Upper bounds on the diameter of domination dot-critical graphs with given connectivity

DOI10.1016/J.DAM.2013.05.011MaRDI QIDQ2444534zbMATH OpenOpenAlexFDO

Authors Michitaka Furuya

Publication date 10 April 2014

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

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

zbMATH Keywords

connectivitydiameterdot-critical graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Upper bound on the diameter of a domination dot-critical graph
• On the diameter of a domination dot-critical graph
• On the diameter of dot-critical graphs
• The diameter of connected domination critical graphs.
• The diameter of domination k‐critical graphs

Cites work

• Construction of (, k)-critical graphs
• Domination dot-critical graphs
• Domination dot-critical graphs with no critical vertices
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On the diameter of a domination dot-critical graph
• On the diameter of dot-critical graphs
• Upper bound on the diameter of a domination dot-critical graph
• Vertex domination‐critical graphs

Cited in

(7)

• On the diameter of a domination dot-critical graph
• Upper bound on the diameter of a domination dot-critical graph
• Upper bound on the diameter of a total domination vertex critical graph.
• On the diameter of dot-critical graphs
• Note: The diameter of edge domination critical graphs
• scientific article; zbMATH DE number 2174617 (Why is no real title available?)
• Domination game critical graphs

This page was built for publication: Upper bounds on the diameter of domination dot-critical graphs with given connectivity

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