On the degree distance of unicyclic graphs with given matching number

DOI10.1007/S00373-015-1527-4zbMath1328.05060OpenAlexW2064094723MaRDI QIDQ897281

Huihui Zhang, Yibing Song, Shuchao Li

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1527-4

zbMATH Keywords

matching numberunicyclic graphdegree distance

Mathematics Subject Classification ID

Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (6)

Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications ⋮ On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum ⋮ On the difference between the eccentric connectivity index and eccentric distance sum of graphs ⋮ Degree resistance distance of trees with some given parameters ⋮ General degree distance of graphs ⋮ On the minimum eccentric distance sum of bipartite graphs with some given parameters

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree distance of unicyclic and bicyclic graphs
• Ordering connected graphs having small degree distances
• On the degree distance of a graph
• The minimum degree distance of graphs of given order and size
• Properties of connected graphs having minimum degree distance
• Bounds on the largest eigenvalues of trees with a given size of matching
• On the spectral radius of unicyclic graphs with perfect matchings
• Some extremal properties of the degree distance of a graph
• Degree distance of unicyclic graphs with given matching number
• Unicyclic and bicyclic graphs having minimum degree distance
• Wiener index of trees: Theory and applications

This page was built for publication: On the degree distance of unicyclic graphs with given matching number