𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sharp bounds for Zagreb indices of maximal outerplanar graphs

✍ Scribed by Ailin Hou; Shuchao Li; Lanzhen Song; Bing Wei

Publisher
Springer US
Year
2010
Tongue
English
Weight
657 KB
Volume
22
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sharp upper bounds for Zagreb indices of
Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
✍ Shuchao Li; Minjie Zhang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 255 KB

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diame

An Optimal Simple Parallel Algorithm for
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs
✍ Shan-Chyun Ku; Biing-Feng Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th

Sharp bounds for decompositions of graph
Sharp bounds for decompositions of graphs into completer-partite subgraphs
✍ Gregory, David A.; Vander Meulen, Kevin N. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 435 KB πŸ‘ 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w