𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Testing Graph Isomorphism

✍ Scribed by Fischer, Eldar; Matsliah, Arie


Book ID
118180852
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
263 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Random Graph Isomorphism
✍ Babai, LΓ‘szlΓ³; Erdo˝s, Paul; Selkow, Stanley M. πŸ“‚ Article πŸ“… 1980 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 638 KB
On testing isomorphism of permutation gr
✍ Charles J. Colbourn πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 530 KB

## Abstract A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2‐dimensional partial orders) is described. It operates by performing two types of simplifying transformations on the graph; the contraction of duplicate vertices and the contraction of un

Reductions to Graph Isomorphism
✍ Jacobo TorΓ‘n πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 382 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

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.