On the domination number of prisms of graphs

Alewyn P. Burger, Christina M. Mynhardt, and William D. Weakley. "On the domination number of prisms of graphs." Discussiones Mathematicae Graph Theory 24.2 (2004): 303-318. <http://eudml.org/doc/270590>.

@article{AlewynP2004,
abstract = {For a permutation π of the vertex set of a graph G, the graph π G is obtained from two disjoint copies G₁ and G₂ of G by joining each v in G₁ to π(v) in G₂. Hence if π = 1, then πG = K₂×G, the prism of G. Clearly, γ(G) ≤ γ(πG) ≤ 2 γ(G). We study graphs for which γ(K₂×G) = 2γ(G), those for which γ(πG) = 2γ(G) for at least one permutation π of V(G) and those for which γ(πG) = 2γ(G) for each permutation π of V(G).},
author = {Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {domination; graph products; prisms of graphs},
language = {eng},
number = {2},
pages = {303-318},
title = {On the domination number of prisms of graphs},
url = {http://eudml.org/doc/270590},
volume = {24},
year = {2004},
}

TY - JOUR
AU - Alewyn P. Burger
AU - Christina M. Mynhardt
AU - William D. Weakley
TI - On the domination number of prisms of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 2
SP - 303
EP - 318
AB - For a permutation π of the vertex set of a graph G, the graph π G is obtained from two disjoint copies G₁ and G₂ of G by joining each v in G₁ to π(v) in G₂. Hence if π = 1, then πG = K₂×G, the prism of G. Clearly, γ(G) ≤ γ(πG) ≤ 2 γ(G). We study graphs for which γ(K₂×G) = 2γ(G), those for which γ(πG) = 2γ(G) for at least one permutation π of V(G) and those for which γ(πG) = 2γ(G) for each permutation π of V(G).
LA - eng
KW - domination; graph products; prisms of graphs
UR - http://eudml.org/doc/270590
ER -