Trees with Maximum Vertex-Degree-Based Topological Indices

DOI10.46793/match.88-3.535GzbMath1505.92280OpenAlexW4281476060MaRDI QIDQ5050727

No author found.

Publication date: 17 November 2022

Published in: Match Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.88-3.535g

Mathematics Subject Classification ID

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)

Related Items (4)

How to Compute the M-Polynomial of (Chemical) Graphs ⋮ Counting maximal independent sets in some \(n\)-gonal cacti ⋮ An alternative proof of the Sombor index minimizing property of greedy trees ⋮ Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)

Cites Work

• The harmonic index for graphs
• Atom-bond connectivity index of trees
• On a novel connectivity index
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• Augmented Zagreb index
• The balanced double star has maximum exponential second Zagreb index
• Trees with maximum exponential Randić index
• On the inverse sum indeg index
• Sharp bounds of the hyper-Zagreb index on acyclic, unicylic, and bicyclic graphs
• Arithmetic-geometric index and its relations with geometric-arithmetic index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with Maximum Vertex-Degree-Based Topological Indices