Rooted product of graphs
id:
rooted-product-of-graphs-299-774843
title:
Rooted product of graphs
text:
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 vi of G, identify vi with the root node of the i-th copy of H. More formally, assuming that and that the root node of H is h1, define where and If G is also rooted at g1, one can view the product itself as rooted, at. The rooted product is a subgraph of the cartesian product of the same two graphs.
brand slug:
wiki
category slug:
encyclopedia
description:
Binary operation performed on graphs
original url:
https://en.wikipedia.org/wiki/Rooted_product_of_graphs
date created:
date modified:
2023-07-19T22:22:43Z
main entity:
{"identifier":"Q7366596","url":"https://www.wikidata.org/entity/Q7366596"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/82/Graph-rooted-product.svg","width":668,"height":335}
fields total:
13
integrity:
15