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 Edit this on Wikidata


Publication date: 27 January 2015

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

Abstract: Given two disjoint copies of a graph G, denoted G1 and G2, and a permutation pi of V(G), the graph piG is constructed by joining uinV(G1) to pi(u)inV(G2) for all uinV(G1). G is said to be a universal fixer if the domination number of piG is equal to the domination number of G for all pi of V(G). 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)





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)