The diameter of paired-domination vertex critical graphs

DOI10.1007/S10587-008-0057-0zbMATH Open1174.05093OpenAlexW2108271056MaRDI QIDQ3624924FDOQ3624924

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paired-domination in claw-free cubic graphs
• Critical concepts in domination
• Vertex domination-critical graphs
• The diameter of domination k‐critical graphs
• Paired-domination in graphs
• Domination critical graphs
• Paired-domination of trees
• The diameter of total domination vertex critical graphs
• Vertex domination‐critical graphs
• Hamiltonian properties of domination-critical graphs
• Total and paired-domination numbers of a tree
• Graphs with large paired-domination number
• Paired-domination
• Vertices contained in all or in no minimum paired-dominating set of a tree

Cited In (10)

• Graphs with maximum size and given paired-domination number
• 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
• Title not available (Why is that?)
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Paired Domination in Graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The diameter of domination k‐critical graphs 👍 👎
• On the diameter of a domination dot-critical graph 👍 👎
• The diameter of total domination vertex critical graphs 👍 👎
• On the diameter of dot-critical graphs 👍 👎
• On the diameter of total domination vertex-critical graphs 👍 👎
• Note: The diameter of edge domination critical graphs 👍 👎
• Upper bound on the diameter of a total domination vertex critical graph. 👍 👎
• The diameter of connected domination critical graphs. 👍 👎

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)