Rooted product of graphs - Alchetron, the free social encyclopedia

In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take |V(G)| copies of H, and for every vertex v i of G, identify v i with the root node of the i-th copy of H.

More formally, assuming that V(G) = {g₁, ..., g_n}, V(H) = {h₁, ..., h_m} and that the root node of H is h 1 , define

G ∘ H := ( V , E )

where

V = { ( g i , h j ) : 1 ≤ i ≤ n , 1 ≤ j ≤ m }

and

E = { ( ( g i , h 1 ) , ( g k , h 1 ) ) : ( g i , g k ) ∈ E ( G ) } ∪ ⋃ i = 1 n { ( ( g i , h j ) , ( g i , h k ) ) : ( h j , h k ) ∈ E ( H ) }

If G is also rooted at g₁, one can view the product itself as rooted, at (g₁, h₁). The rooted product is a subgraph of the cartesian product of the same two graphs.

Applications

The rooted product is especially relevant for trees, as the rooted product of two trees is another tree. For instance, Koh et al. (1980) used rooted products to find graceful numberings for a wide family of trees.

If H is a two-vertex complete graph K₂, then for any graph G, the rooted product of G and H has domination number exactly half of its number of vertices. Every connected graph in which the domination number is half the number of vertices arises in this way, with the exception of the four-vertex cycle graph. These graphs can be used to generate examples in which the bound of Vizing's conjecture, an unproven inequality between the domination number of the graphs in a different graph product, the cartesian product of graphs, is exactly met (Fink et al. 1985). They are also well-covered graphs.

References

Rooted product of graphs Wikipedia

(Text) CC BY-SA