𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph algebras and the graph isomorphism problem

✍ Scribed by I. N. Ponomarenko

Publisher
Springer
Year
1994
Tongue
English
Weight
525 KB
Volume
5
Category
Article
ISSN
0938-1279

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

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.