Vertices contained in all minimum paired-dominating sets of a tree
From MaRDI portal
Publication:3617962
DOI10.1007/S10587-007-0069-1zbMATH Open1174.05090OpenAlexW1988198832MaRDI QIDQ3617962FDOQ3617962
Authors: Xuegang Chen
Publication date: 31 March 2009
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/31138
Recommendations
Trees (05C05) 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?)
- Strong equality of domination parameters in trees
- Paired-domination in graphs
- Vertices contained in every minimum dominating set of a tree
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Vertices contained in all or in no minimum total dominating set of a tree
Cited In (3)
This page was built for publication: Vertices contained in all minimum paired-dominating sets of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617962)