Edgeless graphs are the only universal fixers

DOI10.1007/S10587-014-0136-3zbMath1349.05266arXiv1308.5466OpenAlexW2084507246MaRDI QIDQ5496701

Kirsti Wash

Publication date: 27 January 2015

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

Full work available at URL: https://arxiv.org/abs/1308.5466

zbMATH Keywords

prismdomination numberuniversal fixer

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Convex and weakly convex domination in prism graphs ⋮ Distance 2-domination in prisms of graphs

Cites Work

• Unnamed Item
• Regular graphs are not universal fixers
• Bipartite graphs are not universal fixers
• Claw-free graphs are not universal fixers
• On dominating the Cartesian product of a graph and K₂

This page was built for publication: Edgeless graphs are the only universal fixers