Learn More
A graph G is called a prism fixer if γ(G × K 2) = γ(G), where γ(G) denotes the domination number of G. A symmetric γ-set of G is a minimum dominating set D which admits a partition D = D 1 ∪ D 2 such that V (G) − N [D i ] = D j , i, j = 1, 2, i = j. It is known that G is a prism fixer if and only if G has a symmetric γ-set. Hartnell and Rall [On dominating(More)
  • 1