Regular graphs are not universal fixers

DOI10.1016/j.disc.2008.09.016zbMath1216.05098OpenAlexW2157516444MaRDI QIDQ960938

Christina M. Mynhardt, Alewyn P. Burger

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.016

zbMATH Keywords

dominationuniversal fixergeneralized prism of a graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Claw-free graphs are not universal fixers ⋮ Edgeless graphs are the only universal fixers

Cites Work

• Bipartite graphs are not universal fixers
• Claw-free graphs are not universal fixers
• Fractional domination in prisms
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular graphs are not universal fixers