Minimum degree distance among cacti with perfect matchings

DOI10.1016/j.dam.2016.01.005zbMath1333.05080OpenAlexW2321222527MaRDI QIDQ266964

Yunchao Hong, Zhongxun Zhu

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.005

zbMATH Keywords

matchingdegree distancecactus

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

General degree distance of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree distance of unicyclic and bicyclic graphs
• On the sum-connectivity index of cacti
• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• 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
• Some extremal properties of the degree distance of a graph
• Unicyclic and bicyclic graphs having minimum degree distance

This page was built for publication: Minimum degree distance among cacti with perfect matchings