What is the Strong Product Of Graphs? [Discrete Mathematics] +3 examples! скачать в хорошем качестве

What is the Strong Product Of Graphs? [Discrete Mathematics] +3 examples!

What is the strong product of graphs? This video shows you how to find the strong product of 2 graphs and explains the definition of the graph strong product. We'll work through several examples and analyze the properties of the strong product. By the end of this video, you will know how to find the strong product of 2 undirected graphs. The strong product of 2 undirected graphs G and H is itself a graph with vertex set equal to the cartesian product of the vertex sets of graphs G and H. The adjacency conditions for vertices in the strong product are the union of the adjacency rules for the graph cartesian product and the graph tensor product. I suggest you watch my videos on the cartesian and tensor products for necessary background information. ******************************************************************************************************* If you want to learn more about graph products, I highly recommend the following book: "Handbook of Product Graphs": https://amzn.to/3HjF5D8 Note: This is my Amazon Affiliate link. As an Amazon Associate I may earn commissions for purchases made through the link above.