A proof of the universal fixer conjecture

Monika Rosicka

Abstract

For a given graph G = (V, E) and permutation pi : V -> V the prism pi G of G is defined as follows: V(pi G) = V(G) boolean OR V(G'), where G' is a copy of G, and E(pi G) = E(G) boolean OR E(G') boolean OR M-pi where M-pi = {uv' : u is an element of V (G), v = pi(u)} and v' denotes the copy of v in G'. The graph G is called a universal fixer if gamma(pi G) = gamma(G) for every permutation pi. The idea of universal fixers was introduced by Burger, Mynhardt and Weakley in 2004. In this work we prove that the edgeless graphs (K-n) over bar, are the only universal fixers.
Author Monika Rosicka (FMPI / ITPA)
Monika Rosicka,,
- Institute of Theoretical Physics and Astrophysics
Journal seriesUtilitas Mathematica, ISSN 0315-3681, (A 15 pkt)
Issue year2018
Vol108
Pages125-132
Publication size in sheets0.5
Keywords in Englishprism graphs, domination
Languageen angielski
Score (nominal)15
ScoreMinisterial score = 15.0, 09-11-2018, ArticleFromJournal
Ministerial score (2013-2016) = 15.0, 09-11-2018, ArticleFromJournal
Publication indicators WoS Impact Factor: 2016 = 0.261 (2) - 2016=0.336 (5)
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back