๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Extremal Zagreb Indices of Graphs with Cut Edges

โœ Scribed by Yanqin Feng; Xia Hu; Shuchao Li

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
566 KB
Volume
110
Category
Article
ISSN
0167-8019

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Bounds on the eigenvalues of graphs with
Bounds on the eigenvalues of graphs with cut vertices or edges
โœ Bao-Xuan Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB

In this paper, we characterize the extremal graph having the maximal Laplacian spectral radius among the connected bipartite graphs with n vertices and k cut vertices, and describe the extremal graph having the minimal least eigenvalue of the adjacency matrices of all the connected graphs with n ver

On the maximum and minimum Zagreb indice
On the maximum and minimum Zagreb indices of graphs with connectivity at most
โœ Shuchao Li; Haibing Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 401 KB

a b s t r a c t 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 the products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of graphs of order n with