Displaying similar documents to “Planar Permutation Graphs”

On the domination number of prisms of graphs

Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley (2004)

Discussiones Mathematicae Graph Theory

Similarity:

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

Dynamic cage survey.

Exoo, Geoffrey, Jajcay, Robert (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity: