Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3

DOI10.1016/j.dam.2024.09.006MaRDI QIDQ6648256

Wenshui Lin, Chengxi Hong, Yuehan Wu, Peifang Fu

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundsextremal graphstreesinverse sum indeg index

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp bounds on the inverse sum indeg index
• The extremal values of the Wiener index of a tree with given degree sequence
• Graphs with given degree sequence and maximal spectral radius
• Upper bounds for the inverse sum indeg index of graphs
• Some results on the inverse sum indeg index of a graph
• Inverse sum indeg index of graphs
• Linear and non-linear inequalities on the inverse sum indeg index
• On two conjectures concerning trees with maximal inverse sum indeg index
• On the inverse sum indeg index
• On connected graphs and trees with maximal inverse sum indeg index
• The inverse sum indeg index of graphs with some given parameters
• Some new upper bounds for the inverse sum indeg index of graphs

This page was built for publication: Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3