What is the Modular Product of Graphs? [Discrete Math]
This video introduces the modular product of graphs, along with 3 visual examples. We will analyze 2 interesting properties of the modular product as well, one with respect to complementation and the other to subgraph isomorphisms of the factor graphs. The modular product of graphs is a graph product based on the cartesian product, where the vertex set is the cartesian product of the vertex sets of the factor graphs, and the edge set is produced through 2 "adjacency rules" or requirements for adjacency. The modular product has been used to transform problems of induced subgraph isomorphism to problems of finding cliques or maximum cliques in graphs.
For more information, see these links:
https://en.wikipedia.org/wiki/Modular...
https://www.sciencedirect.com/science...
https://link.springer.com/article/10....
*******************************************************************************************************
If you want to learn more about graph products, I highly recommend the following book:
"Handbook of Product Graphs": https://amzn.to/48WKqfy
Note: This is my Amazon Affiliate link. As an Amazon Associate I may earn commissions for purchases made through the link above.
Смотрите видео What is the Modular Product of Graphs? [Discrete Math] онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь Vital Sine 13 Декабрь 2021, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 1,095 раз и оно понравилось 16 людям.