𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reductions to Graph Isomorphism

✍ Scribed by Jacobo Torán

Publisher
Springer
Year
2008
Tongue
English
Weight
382 KB
Volume
47
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Focality and graph isomorphism
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.

The graph isomorphism problem
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