On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
From MaRDI portal
Publication:1241450
DOI10.1007/BFB0089374zbMath0366.05019MaRDI QIDQ1241450
No author found.
Publication date: 1976
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
cellular algebrasprimitivityimprimitivitycentralizer rings of permutation group theoryconstruction of strongly regular graphspractical algorithms of graph canonization
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Other designs, configurations (05B30) Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (91)
On T-amorphous association schemes ⋮ Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time ⋮ Graph algebras and the graph isomorphism problem ⋮ On computation complexity problems concerning relation algebras ⋮ Isomorphism Testing for Graphs Excluding Small Minors ⋮ A non-Schurian coherent configuration on 14 points exists ⋮ On the Combinatorial Power of the Weisfeiler-Lehman Algorithm ⋮ Adjacency Matrices ⋮ Coherent algebras ⋮ A modular absolute bound condition for primitive association schemes ⋮ Class 3 association schemes whose symmetrizations have two classes ⋮ Uniqueness of strongly regular graphs having minimal \(p\)-rank ⋮ On the geometric graph isomorphism problem ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Unnamed Item ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ Commutative association schemes whose symmetrizations have two classes ⋮ Jordan schemes ⋮ On association schemes with multiplicities 1 or a prime p ⋮ Transitive groups with irreducible representations of bounded degree ⋮ Schur rings over the elementary abelian group of order 64 ⋮ Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments ⋮ On WL-rank of Deza Cayley graphs ⋮ Nonlocal games and quantum permutation groups ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Generalized X-join of graphs and their automorphisms ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ Neighbourhoods of transitive graphs and GRR's ⋮ Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas ⋮ Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ On the automorphism groups of rank-4 primitive coherent configurations ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ Isomorphism Testing Parameterized by Genus and Beyond ⋮ Wreath products and projective system of non-Schurian association schemes ⋮ Theory of graph neural networks: representation and learning ⋮ Some elements of a Galois theory of the structure and complexity of the tree automorphism problem ⋮ The graph isomorphism problem and approximate categories ⋮ Directed strongly regular graphs obtained from coherent algebras ⋮ Coherent algebras and the graph isomorphism problem ⋮ Characters of finite quasigroups. VI: Critical examples and doubletons ⋮ Non rank 3 strongly regular graphs with the 5-vertex condition ⋮ On a new family of (P and Q)-polynomial schemes ⋮ On quasi-thin association schemes ⋮ \(C\)-algebras and algebras in Plancherel duality ⋮ Two inequalities for parameters of a cellular algebra ⋮ Galois correspondence between permutation groups and cellular rings (association schemes) ⋮ The isomorphism problem for classes of graphs closed under contraction ⋮ Partitions in matrices and graphs ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time ⋮ On Cayley representations of finite graphs over Abelian $p$-groups ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ Polynomial time recognition and testing of isomorphism of cyclic tournaments ⋮ An upper bound for the order of primitive permutation groups ⋮ Nilpotent closed subsets of association schemes ⋮ Cartan coherent configurations ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\) ⋮ Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments ⋮ On the power of combinatorial and spectral invariants ⋮ An optimal lower bound on the number of variables for graph identification ⋮ A construction of the automorphism groups of indecomposable S-rings over \(Z_{2^n}\) ⋮ A solution of a problem of A. E. Brouwer ⋮ Upper bounds given by equitable partitions of a primitive association scheme ⋮ Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming ⋮ Hashing and canonicalizing Notation 3 graphs ⋮ Unnamed Item ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ Separability of Schur rings over abelian \(p\)-groups ⋮ Graph isomorphism restricted by lists ⋮ A wedge product of association schemes ⋮ On Schur rings over cyclic groups ⋮ Algebras in Plancherel duality and algebraic combinatorics ⋮ Classifying strongly regular graphs using lexical ordering of adjacency matrices ⋮ The mathematics of Donald Gordon Higman ⋮ Higmanian rank-5 association schemes on 40 points ⋮ The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time ⋮ Permutation group approach to association schemes ⋮ Efficient graph automorphism by vertex partitioning ⋮ The basis digraphs of \(p\)-schemes ⋮ Compact cellular algebras and permutation groups ⋮ On a new high dimensional Weisfeiler-Lehman algorithm ⋮ On graphs with three eigenvalues ⋮ Association schemes of small order ⋮ Novel techniques to speed up the computation of the automorphism group of a graph ⋮ Sherali-Adams relaxations of graph isomorphism polytopes ⋮ Graph isomorphism problem ⋮ Circulant graphs: efficient recognizing and isomorphism testing ⋮ Primitivity of permutation groups, coherent algebras and matrices ⋮ Two families of strongly regular graphs with the 4-vertex condition
This page was built for publication: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
