The diameter of paired-domination vertex critical graphs

DOI10.1007/S10587-008-0057-0MaRDI QIDQ3624924zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Christina M. Mynhardt

Publication date 6 May 2009

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/37874, http://hdl.handle.net/10338.dmlcz/140428

zbMATH Keywords

boundsdiametervertex criticalpaired-domination numberpaired-dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Diameter of paired domination edge-critical graphs
• The diameter of connected domination critical graphs.
• The diameter of total domination vertex critical graphs
• On the diameter of total domination vertex-critical graphs
• The diameter of domination k‐critical graphs
• Note: The diameter of edge domination critical graphs
• On the diameter of a domination dot-critical graph
• scientific article; zbMATH DE number 6096635
• Upper bound on the diameter of a total domination vertex critical graph.
• On the diameter of dot-critical graphs

Cites work

• scientific article; zbMATH DE number 1185309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124609 (Why is no real title available?)
• scientific article; zbMATH DE number 1743834 (Why is no real title available?)
• scientific article; zbMATH DE number 2188616 (Why is no real title available?)
• scientific article; zbMATH DE number 2192132 (Why is no real title available?)
• scientific article; zbMATH DE number 5054162 (Why is no real title available?)
• Critical concepts in domination
• Domination critical graphs
• Graphs with large paired-domination number
• Hamiltonian properties of domination-critical graphs
• Paired-domination
• Paired-domination in claw-free cubic graphs
• Paired-domination in graphs
• Paired-domination of trees
• The diameter of domination k‐critical graphs
• The diameter of total domination vertex critical graphs
• Total and paired-domination numbers of a tree
• Trees with large paired-domination number
• Vertex domination-critical graphs
• Vertex domination‐critical graphs
• Vertices contained in all or in no minimum paired-dominating set of a tree

Cited in

(12)

• Graphs with maximum size and given paired-domination number
• Diameter of paired domination edge-critical graphs
• Which trees have a differentiating-paired dominating set?
• On the existence problem of the total domination vertex critical graphs
• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Perfect matchings in paired domination vertex critical graphs
• Paired domination vertex critical graphs
• Graphs with disjoint dominating and paired-dominating sets
• scientific article; zbMATH DE number 6096635 (Why is no real title available?)
• Paired domination in graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Certified domination critical graphs upon vertex removal

This page was built for publication: The diameter of paired-domination vertex critical graphs

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