Note on extremal graphs with given matching number

DOI10.1016/J.AMC.2017.03.016zbMath1411.05135OpenAlexW2605191020MaRDI QIDQ1738091

Hua Wang, Ya-Hong Chen, Xiao Dong Zhang

Publication date: 29 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.016

zbMATH Keywords

extremal graphsmatching numbertopological indices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Peripheral Wiener index of trees and related questions ⋮ The greatest values for atom-bond sum-connectivity index of graphs with given parameters ⋮ Extremal graphs with respect to generalized ABC index ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds

Cites Work

• Some results on the reciprocal sum-degree distance of graphs
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• Spectral radius of graphs with given matching number
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• Matching theory
• On comparing Zagreb indices
• The Maximum Wiener Index of Trees with Given Degree Sequences
• The number of spanning trees of a graph with given matching number
• Extremal Laplacian-energy-like invariant of graphs with given matching number
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on extremal graphs with given matching number