✦ LIBER ✦

Graph isomorphism and equality of simplices

✍ Scribed by V. Yu. Protasov

Book ID: 110149530
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 559 KB
Volume: 85
Category: Article
ISSN: 0001-4346
DOI: 10.1134/s0001434609050137

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A term equality problem equivalent to gr

A term equality problem equivalent to graph isomorphism

✍ David A. Basin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Focality and graph isomorphism

✍ W. Imrich; G. Sabidussi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A graph is focal if the stabiliser of every vertex x fixes exactly one edge not incident with x. It is shown that the problem of testing whether a connected bipartite graph is focal has the same complexity as the graph isomorphism problem. Several other similar questions are also considered.

Random Graph Isomorphism

✍ Babai, László; Erdo˝s, Paul; Selkow, Stanley M. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 638 KB

Testing Graph Isomorphism

✍ Fischer, Eldar; Matsliah, Arie 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 263 KB

Graph algebras and the graph isomorphism

Graph algebras and the graph isomorphism problem

✍ I. N. Ponomarenko 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 525 KB

The graph isomorphism problem

✍ X. Liu; D. J. Klein 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

A chemically and graph-theoretically relevant problem is that of determining whether a pair of graphs G and G' are isomorphic. A two-stage computational test is developed. In the first stage an "eigenvalue-eigenprojector" tabular graph-theoretic invariant is computed, whence if the two tables differ