๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph isomorphism problem and 2-closed permutation groups

โœ Scribed by I. N. Ponomarenko


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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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

Graphs and finite permutation groups
โœ Charles C. Sims ๐Ÿ“‚ Article ๐Ÿ“… 1967 ๐Ÿ› Springer-Verlag ๐ŸŒ French โš– 624 KB