Page 1

Displaying 1 – 2 of 2

Showing per page

Convex universal fixers

Magdalena Lemańska, Rita Zuazua (2012)

Discussiones Mathematicae Graph Theory

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 ' ) 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...

Currently displaying 1 – 2 of 2

Page 1