Bipartite graphs are not universal fixers

DOI10.1016/J.DISC.2007.11.006MaRDI QIDQ998325zbMATH OpenOpenAlexFDO

Authors Richard G. Gibson

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphsdominationprisms of graphsuniversal fixers

Mathematics Subject Classification ID

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

Recommendations

• Regular graphs are not universal fixers
• Edgeless graphs are the only universal fixers.
• Domination in bipartite graphs
• Claw-free graphs are not universal fixers
• A proof of the universal fixer conjecture

Cites work

• Distance and connectivity measures in permutation graphs
• scientific article; zbMATH DE number 5556299 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On diameter of permutation graphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs

Cited in

(3)

• Edgeless graphs are the only universal fixers.
• Regular graphs are not universal fixers
• Claw-free graphs are not universal fixers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998325)