𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Hardness of Graph Isomorphism

✍ Scribed by Torán, Jacobo

Book ID
118181193
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
545 KB
Volume
33
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the cycle-isomorphism of graphs
On the cycle-isomorphism of graphs
✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor

Note on Isomorphisms of Graphs
Note on Isomorphisms of Graphs
✍ Halin, R.; Jung, H. A. 📂 Article 📅 1967 🏛 Oxford University Press 🌐 English ⚖ 86 KB