Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3
DOI10.1016/J.DAM.2024.09.006MaRDI QIDQ6648256FDOQ6648256
Authors: Yuehan Wu, Chengxi Hong, Peifang Fu, Wenshui Lin 
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- The extremal values of the Wiener index of a tree with given degree sequence
- Graphs with given degree sequence and maximal spectral radius
- On the inverse sum indeg index
- Sharp bounds on the inverse sum indeg index
- On the minimal ABC index of connected graphs with given degree sequence
- A note on chemical trees with maximal inverse sum indeg index
- On connected graphs and trees with maximal inverse sum indeg index
- 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
- The inverse sum indeg index of graphs with some given parameters
- Some new upper bounds for the inverse sum indeg index of graphs
- Title not available (Why is that?)
- Linear and non-linear inequalities on the inverse sum indeg index
- On two conjectures concerning trees with maximal inverse sum indeg index
This page was built for publication: Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648256)
