On two conjectures concerning trees with maximal inverse sum indeg index

DOI10.1007/s40314-022-01964-6OpenAlexW4286213353WikidataQ123238387 ScholiaQ123238387MaRDI QIDQ2167390

Yikai Wang, Peng Hu, Wenshui Lin, Peifang Fu, Guo-Dong Zhang

Publication date: 25 August 2022

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

Full work available at URL: https://doi.org/10.1007/s40314-022-01964-6

zbMATH Keywords

extremal graphstreesgreedy treeinverse sum indeg index

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

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
• Some results on the inverse sum indeg index of a graph
• Linear and non-linear inequalities on the inverse sum indeg index
• First order strong convergence of an explicit scheme for the stochastic SIS epidemic model
• On the inverse sum indeg index
• The inverse sum indeg index of graphs with some given parameters

This page was built for publication: On two conjectures concerning trees with maximal inverse sum indeg index