On the connectivity index of trees
From MaRDI portal
Publication:937643
DOI10.1007/s10910-007-9281-3zbMath1145.05034MaRDI QIDQ937643
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
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C40: Connectivity
Related Items
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, On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\), On the extremal Zagreb indices of graphs with cut edges, On the maximum Zagreb indices of graphs with \(k\) cut vertices, Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
Cites Work