On the connectivity index of trees

DOI10.1007/s10910-007-9281-3zbMath1145.05034OpenAlexW2110070443MaRDI QIDQ937643

Mei Lu, Yue Jiang

Publication date: 15 August 2008

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-007-9281-3

zbMATH Keywords

treediameterconnectivity index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (8)

Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices ⋮ Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter ⋮ Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number ⋮ On the extremal Zagreb indices of graphs with cut edges ⋮ On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\) ⋮ On the maximum Zagreb indices of graphs with \(k\) cut vertices ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges

Cites Work

• Trees of extremal connectivity index

This page was built for publication: On the connectivity index of trees