Extremal Graphs for Vertex-Degree-Based Indices with Given Matching Number
DOI10.46793/MATCH.91-2.499WMaRDI QIDQ6130047FDOQ6130047
Authors: Mihrigul Wali, Jianguo Qian, Chao Shi 
Publication date: 18 April 2024
Published in: Match Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Recommendations
- Extremal values of vertex-degree-based topological indices over graphs
- Note on extremal graphs with given matching number
- The extremal values of some topological indices in bipartite graphs with a given matching number
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
- Upper bounds on some indices of graphs with a given matching number
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)
This page was built for publication: Extremal Graphs for Vertex-Degree-Based Indices with Given Matching Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130047)
