On the connectivity index of trees
From MaRDI portal
Publication:937643
DOI10.1007/S10910-007-9281-3zbMATH Open1145.05034OpenAlexW2110070443MaRDI QIDQ937643FDOQ937643
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
Recommendations
Applications of graph theory (05C90) Connectivity (05C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
Cited In (18)
- Title not available (Why is that?)
- Graphs with extremal connectivity index
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
- Extremal results for directed tree connectivity
- Sharp bounds for Zagreb indices of maximal outerplanar graphs
- On the sum-connectivity index of trees
- On the extremal Zagreb indices of graphs with cut edges
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- On the Connectivity of Token Graphs of Trees
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- The starlike trees with maximum and minimum second order connectivity index
- Higher order connectivity index of starlike trees
- 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\)
- Title not available (Why is that?)
- On the extremal connectivity index of trees with \(k\) pendant vertices
- Title not available (Why is that?)
This page was built for publication: On the connectivity index of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937643)
