scientific article; zbMATH DE number 863496
From MaRDI portal
Publication:4871775
zbMath0846.05042MaRDI QIDQ4871775
Publication date: 29 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyautomorphism groupsCayley graphsreconstruction problemrepresentation problemgraph isomorphisms
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (only showing first 100 items - show all)
The planar cubic Cayley graphs of connectivity 2 ⋮ Pseudo-random properties of self-complementary symmetric graphs ⋮ Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Symmetry in Mathematical Programming ⋮ Amalgams of inverse semigroups and reversible two-counter machines. ⋮ A class of compartmental models for long-distance tracer transport in plants ⋮ Information theoretic measures of UHG graphs with low computational complexity ⋮ The structure of Cayley graphs of dihedral groups of Valencies 1, 2 and 3 ⋮ Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps ⋮ Reconstructing under group actions. ⋮ On transitive generalized Cayley graphs of semigroups ⋮ Edge-transitive token graphs ⋮ 3-connected reduction for regular graph covers ⋮ Unnamed Item ⋮ Maximum likelihood estimates of pairwise rearrangement distances ⋮ Distance-related invariants on polygraphs ⋮ Graph isomorphism, color refinement, and compactness ⋮ Jordan-like characterization of automorphism groups of planar graphs ⋮ Connective constants and height functions for Cayley graphs ⋮ Self-avoiding walks and amenability ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Completely distinguishable automata and the set of synchronizing words ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Quantum and non-signalling graph isomorphisms ⋮ Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs ⋮ On two generalized connectivities of graphs ⋮ Towards an isomorphism dichotomy for hereditary graph classes ⋮ Digraph representations of 2-closed permutation groups with a normal regular cyclic subgroup ⋮ Constructing Hard Examples for Graph Isomorphism ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Graphical cyclic permutation groups ⋮ Hodge Laplacians on Graphs ⋮ Realizing finite groups in Euclidean space ⋮ Self-Avoiding Walks and Connective Constants ⋮ Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic ⋮ Finite nilpotent groups that coincide with their 2-closures in all of their faithful permutation representations ⋮ Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes ⋮ Low-degree factors of random polynomials ⋮ Distinguishing index of graphs with simple automorphism groups ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs ⋮ On Minkowski space and finite geometry ⋮ Automorphisms of Kronrod-Reeb graphs of Morse functions on compact surfaces ⋮ The Planar Cubic Cayley Graphs ⋮ Graphical complexity of products of permutation groups ⋮ A convex polytope and an antimatroid for any given, finite group ⋮ Some problems on Cayley graphs ⋮ On transitive Cayley graphs of pseudo-unitary homogeneous semigroups ⋮ On the diameter of permutation groups ⋮ Bounds on connective constants of regular graphs ⋮ Hamilton circles in Cayley graphs ⋮ Asymptotically optimal induced universal graphs ⋮ Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs ⋮ All self-complementary symmetric graphs ⋮ Infinite families of non-Cayley vertex-transitive tournaments ⋮ Logical aspects of Cayley-graphs: the group case ⋮ Unnamed Item ⋮ On the complexity of deduction modulo leaf permutative equations ⋮ On arc-regular permutation groups using Latin squares ⋮ What is on his mind? ⋮ On the asymptotic proportion of connected matroids ⋮ On the flag graphs of regular abstract polytopes: Hamiltonicity and Cayley index ⋮ Cyclic automorphism groups of graphs and edge-colored graphs ⋮ Cyclic permutation groups that are automorphism groups of graphs ⋮ 16-vertex graphs with automorphism groups A4 and A5 from the icosahedron ⋮ Infinite Hamilton cycles in squares of locally finite graphs ⋮ Direct product of automorphism groups of digraphs ⋮ Universal families of permutation groups. ⋮ Graphical representations of cyclic permutation groups ⋮ Automorphisms of types and their applications ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ A Generic Framework for Engineering Graph Canonization Algorithms ⋮ Unnamed Item ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ Direct product of automorphism groups of colored graphs ⋮ Permutation group approach to association schemes ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Almost all graphs are rigid-revisited ⋮ Hamilton paths and cycles in vertex-transitive graphs of order \(6p\) ⋮ Hamilton cycles and paths in vertex-transitive graphs-current directions ⋮ Hamiltonian paths in Cayley graphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Drawing series parallel digraphs symmetrically ⋮ Automorphisms of types in certain type theories and representation of finite groups ⋮ On a new high dimensional Weisfeiler-Lehman algorithm ⋮ On homogeneous co-maximal graphs of groupoid-graded rings ⋮ Realisation of groups as automorphism groups in permutational categories ⋮ Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn ⋮ Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach ⋮ Almost all graphs are rigid - Revisited ⋮ Small separations in vertex-transitive graphs ⋮ Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups ⋮ Vertex-transitive graphs that have no Hamilton decomposition ⋮ Kolmogorov random graphs only have trivial stable colorings. ⋮ Maximal subgroups of amalgams of finite inverse semigroups. ⋮ Deciding Orthogonality in Construction-A Lattices ⋮ Regular evolution algebras are universally finite ⋮ Abelian permutation groups with graphical representations ⋮ On transitive Cayley graphs of groups and semigroups ⋮ Wreath product in automorphism groups of graphs
This page was built for publication:
