| 词条 | Modular product of graphs |
| 释义 |
In graph theory, the modular product of graphs G and H is a graph formed by combining G and H that has applications to subgraph isomorphism. It is one of several different kinds of graph products that have been studied, generally using the same vertex set (the Cartesian product of the sets of vertices of the two graphs G and H) but with different rules for determining which edges to include. DefinitionThe vertex set of the modular product of G and H is the cartesian product V(G) × V(H). Any two vertices (u, v) and (u' , v' ) are adjacent in the modular product of G and H if and only if either
Application to subgraph isomorphismCliques in the modular product graph correspond to isomorphisms of induced subgraphs of G and H. Therefore, the modular product graph can be used to reduce problems of induced subgraph isomorphism to problems of finding cliques in graphs. Specifically, the maximum common induced subgraph of both G and H corresponds to the maximum clique in their modular product. Although the problems of finding largest common induced subgraphs and of finding maximum cliques are both NP-complete, this reduction allows clique-finding algorithms to be applied to the common subgraph problem. References
| last1 = Barrow | first1 = H. | last2 = Burstall | first2 = R. | author2-link = Rod Burstall | doi = 10.1016/0020-0190(76)90049-1 | issue = 4 | journal = Information Processing Letters | pages = 83–84 | title = Subgraph isomorphism, matching relational structures and maximal cliques | volume = 4 | year = 1976}}.
| last = Levi | first = G. | doi = 10.1007/BF02575586 | issue = 4 | journal = Calcolo | pages = 341–352 | title = A note on the derivation of maximal common subgraphs of two directed or undirected graphs | volume = 9 | year = 1973}}.
| last = Vizing | first = V. G. | authorlink = Vadim G. Vizing | contribution = Reduction of the problem of isomorphism and isomorphic entrance to the task of finding the nondensity of a graph | page = 124 | title = Proc. 3rd All-Union Conf. Problems of Theoretical Cybernetics | year = 1974}}. 1 : Graph products |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。