Rooted product of graphs

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.

The rooted product of graphs.

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\circ H:=(V,E)

where

V=\left\{(g_{i},h_{j}):1\leq i\leq n,1\leq j\leq m\right\}

and

E=\left\{((g_{i},h_{1}),(g_{k},h_{1})):(g_{i},g_{k})\in E(G)\right\}\cup \bigcup _{i=1}^{n}\left\{((g_{i},h_{j}),(g_{i},h_{k})):(h_{j},h_{k})\in E(H)\right\}

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.

gollark: This is also probably wrong. There are perfectly good reasons to spend more than the median family on some category, especially if the categories are particularly granular.

gollark: Oh, and lots of things (particularly computing equipment) are usable for fun *and* work purposes.

gollark: As another example, I spend a nontrivial amount of money on removing small and cheap-to-fix inconveniences from my life (for example, finally getting a mouse as it's nicer than my laptop's trackpad in some ways, getting lots of spare USB cables so I don't have to deal with moving them around, buying pens in boxes of 50-100 so that I can just give them away). Obviously I don't *have* to do that, but I would be inconvenienced and somewhat less productive if I didn't.

gollark: Recreational stuff is somewhat necessary in that you probably need to do fun things to maintain a good mental state, which you need to do things.

gollark: You can't really distinguish them nicely.

References

Godsil, C. D.; McKay, B. D. (1978), "A new graph product and its spectrum" (PDF), Bull. Austral. Math. Soc., 18 (1): 21–28, doi:10.1017/S0004972700007760, MR 0494910.
Fink, J. F.; Jacobson, M. S.; Kinch, L. F.; Roberts, J. (1985), "On graphs having domination number half their order", Period. Math. Hungar., 16 (4): 287–293, doi:10.1007/BF01848079, MR 0833264.
Koh, K. M.; Rogers, D. G.; Tan, T. (1980), "Products of graceful trees", Discrete Mathematics, 31 (3): 279–292, doi:10.1016/0012-365X(80)90139-9, MR 0584121.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.