On the lower and upper bounds for different indices of tricyclic graphs

DOI10.1007/s12190-015-0887-5zbMath1409.05078OpenAlexW2151212515MaRDI QIDQ295418

Lijie Zhu, Shang-Wang Tan, Dong-fang Wang

Publication date: 13 June 2016

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-015-0887-5

zbMATH Keywords

Wiener indexHarary indexhyper-Wiener indextricyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Paths and cycles (05C38) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (3)

Counting independent sets in tricyclic graphs ⋮ On the distance and distance signless Laplacian spectral radii of tricyclic graphs ⋮ Unnamed Item

Cites Work

• On the number of independent sets in cycle-separated tricyclic graphs
• On Harary index of graphs
• On tricyclic graphs of a given diameter with minimal energy
• Tricyclic graphs with maximum Merrifield-Simmons index
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• Sharp lower bound for the total number of matchings of tricyclic graphs
• On the Laplacian coefficients of tricyclic graphs
• The maximum hyper-Wiener index of cacti
• Extremal unicyclic and bicyclic graphs with respect to Harary index
• A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE
• On the sum of all distances in a graph or digraph
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the lower and upper bounds for different indices of tricyclic graphs