The diameter of paired-domination vertex critical graphs

DOI10.1007/s10587-008-0057-0zbMath1174.05093OpenAlexW2108271056MaRDI QIDQ3624924

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

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)

Related Items (9)

Graphs with disjoint dominating and paired-dominating sets ⋮ On the existence problem of the total domination vertex critical graphs ⋮ Perfect matchings in paired domination vertex critical graphs ⋮ Graphs with maximum size and given paired-domination number ⋮ Which trees have a differentiating-paired dominating set? ⋮ An upper bound on the paired-domination number in terms of the number of edges in the graph ⋮ A characterization of graphs with disjoint dominating and paired-dominating sets ⋮ Paired domination vertex critical graphs ⋮ Paired Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination in claw-free cubic graphs
• Graphs with large paired-domination number
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Total and paired-domination numbers of a tree
• Paired-domination of trees
• The diameter of total domination vertex critical graphs
• Critical concepts in domination
• Hamiltonian properties of domination-critical graphs
• Vertex domination-critical graphs
• Paired-domination
• The diameter of domination k‐critical graphs
• Paired-domination in graphs
• Vertex domination‐critical graphs
• Domination critical graphs

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