Minimum degree distance among cacti with perfect matchings

DOI10.1016/J.DAM.2016.01.005MaRDI QIDQ266964zbMATH OpenOpenAlexFDO

Authors Zhongxun Zhu, Yunchao Hong

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

matchingcactusdegree distance

Mathematics Subject Classification ID

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

Recommendations

• On extremal cacti with minimal degree distance.
• Degree distance of unicyclic graphs with given matching number
• On degree resistance distance of cacti
• The degree resistance distance of cacti
• Minimum degree distance of unicyclic graphs with perfect matching

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 5031511 (Why is no real title available?)
• Bounds for the Schultz molecular topological index
• Degree distance of unicyclic and bicyclic graphs
• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• On the degree distance of a graph
• On the sum-connectivity index of cacti
• Properties of connected graphs having minimum degree distance
• Some extremal properties of the degree distance of a graph
• The minimum degree distance of graphs of given order and size
• Unicyclic and bicyclic graphs having minimum degree distance

Cited in

(4)

• On degree resistance distance of cacti
• General degree distance of graphs
• Matchings in hexagonal cacti
• On extremal cacti with minimal degree distance.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266964)