Maximum values of sombor index of bicyclic graphs with a given matching number

DOI10.1051/ita/2023005OpenAlexW4389443180MaRDI QIDQ6186542

ChunLei Xu, Guanru Li

Publication date: 2 February 2024

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2023005

zbMATH Keywords

bicyclic graphsSombor indexmatch number

Mathematics Subject Classification ID

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
• Unnamed Item
• Extremal values of the Sombor index in unicyclic and bicyclic graphs
• Sombor index: review of extremal results and bounds
• Sombor index of trees with at most three branch vertices
• On the Graphs with Minimum Sombor Index
• On the structure of graphs with integer Sombor indices
• Extremal values on the Sombor index of trees
• Reduced Sombor index of bicyclic graphs

This page was built for publication: Maximum values of sombor index of bicyclic graphs with a given matching number