Edgeless graphs are the only universal fixers.
From MaRDI portal
Publication:5496701
DOI10.1007/S10587-014-0136-3zbMATH Open1349.05266arXiv1308.5466OpenAlexW2084507246MaRDI QIDQ5496701FDOQ5496701
Authors: Kirsti Wash
Publication date: 27 January 2015
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Abstract: Given two disjoint copies of a graph , denoted and , and a permutation of , the graph is constructed by joining to for all . is said to be a universal fixer if the domination number of is equal to the domination number of for all of . In 1999 it was conjectured that the only universal fixers are the edgeless graphs. Since then, a few partial results have been shown. In this paper, we prove the conjecture completely.
Full work available at URL: https://arxiv.org/abs/1308.5466
Recommendations
Cites Work
Cited In (9)
- Distance 2-domination in prisms of graphs
- Regular graphs are not universal fixers
- Bipartite graphs are not universal fixers
- Claw-free graphs are not universal fixers
- Convex universal fixers
- Couterexample to a conjecture on the structure of bipartite partionable graphs
- Graphs with \(C_3\)-free vertices are not universal fixers
- Convex and weakly convex domination in prism graphs
- A proof of the universal fixer conjecture
This page was built for publication: Edgeless graphs are the only universal fixers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496701)