What is the Cartesian Product of Graphs? (Discrete Math) +3 examples!
Автор: Vital Sine
Загружено: 2020-09-22
Просмотров: 23438
This video will explain what a cartesian product in graph theory is and how to calculate it.
The Cartesian product of 2 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, with order equal to the product of the orders of graphs G and H, and adjacencies between vertices defined as follows: two vertices (u,u' ) and (v,v' ) are adjacent in G * H if and only if either u = v and u' is adjacent to v' in H, or u' = v' and u is adjacent to v in G.
The Cartesian product of 2 graphs is just one of many graph products, which are operations on graphs that create new graphs from factor graphs.
By learning about graph products, we can change our perspective on what graphs are. Just like numbers multiply and divide, in addition to representing a constant quantity, graphs, too, can act upon each other through graph products. This video gives you a visual perspective on the cartesian product of 2 graphs and walks you through several examples so you know how to calculate this product yourself for any two graphs.
Thanks for watching!
*******************************************************************************************************
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.
00:00 Review
01:05 Definition
03:15 Example 1
06:53 Example 2
08:51 Intuition
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: