Convex universal fixers

@article{MagdalenaLemańska2012,
abstract = {In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G’ a copy of G. For a bijective function π: V(G) → V(G’), define the prism πG of G as follows: V(πG) = V(G) ∪ V(G’) and $E(πG) = E(G) ∪ E(G^\{\prime \}) ∪ M_\{π\}$, where $M_\{π\} = \{u π(u) | u ∈ V(G)\}$. Let γ(G) be the domination number of G. If γ(πG) = γ(G) for any bijective function π, then G is called a universal fixer. In [9] it is conjectured that the only universal fixers are the edgeless graphs K̅ₙ. In this work we generalize the concept of universal fixers to the convex universal fixers. In the second section we give a characterization for convex universal fixers (Theorem 6) and finally, we give an in infinite family of convex universal fixers for an arbitrary natural number n ≥ 10.},
author = {Magdalena Lemańska, Rita Zuazua},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {convex sets; dominating sets; universal fixers},
language = {eng},
number = {4},
pages = {807-812},
title = {Convex universal fixers},
url = {http://eudml.org/doc/271021},
volume = {32},
year = {2012},
}

TY - JOUR
AU - Magdalena Lemańska
AU - Rita Zuazua
TI - Convex universal fixers
JO - Discussiones Mathematicae Graph Theory
PY - 2012
VL - 32
IS - 4
SP - 807
EP - 812
AB - In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G’ a copy of G. For a bijective function π: V(G) → V(G’), define the prism πG of G as follows: V(πG) = V(G) ∪ V(G’) and $E(πG) = E(G) ∪ E(G^{\prime }) ∪ M_{π}$, where $M_{π} = {u π(u) | u ∈ V(G)}$. Let γ(G) be the domination number of G. If γ(πG) = γ(G) for any bijective function π, then G is called a universal fixer. In [9] it is conjectured that the only universal fixers are the edgeless graphs K̅ₙ. In this work we generalize the concept of universal fixers to the convex universal fixers. In the second section we give a characterization for convex universal fixers (Theorem 6) and finally, we give an in infinite family of convex universal fixers for an arbitrary natural number n ≥ 10.
LA - eng
KW - convex sets; dominating sets; universal fixers
UR - http://eudml.org/doc/271021
ER -