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
## 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
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
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.