Minimum degree distance among cacti with perfect matchings

DOI10.1016/J.DAM.2016.01.005zbMATH Open1333.05080OpenAlexW2321222527MaRDI QIDQ266964FDOQ266964

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

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

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)

Cites Work

• Title not available (Why is that?)
• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• 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
• Bounds for the Schultz molecular topological index
• Degree distance of unicyclic and bicyclic graphs
• Title not available (Why is that?)
• On the sum-connectivity index of cacti
• On the degree distance of a graph

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)