On Sombor Index of Graphs with a Given Number of Cut-Vertices

DOI10.46793/match.89-2.437HzbMath1505.92282arXiv2203.08438OpenAlexW4291899014MaRDI QIDQ5050778

Ansar Rehman, Sakander Hayat

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://arxiv.org/abs/2203.08438

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Related Items

Proof of an open problem on the Sombor index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with given number of cut vertices and extremal Merrifield-Simmons index
• Extremal values of the Sombor index in unicyclic and bicyclic graphs
• On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
• On the extremal sombor index of trees with a given diameter
• On Sombor index of trees with fixed domination number
• On relations between Sombor and other degree-based indices
• Sombor index of chemical graphs
• On Sombor index of trees
• Sombor index and degree-related properties of simplicial networks
• Relations between Sombor Index and some Degree-Based Topological Indices
• Sombor Index of Polymers
• Ordering chemical graphs by Sombor indices and its applications
• Extremal values on the Sombor index of trees
• The minimal Kirchhoff index of graphs with a given number of cut vertices