Automorphism groups of graphs

DOI10.1007/BF01371410zbMath0506.05045OpenAlexW2095574399MaRDI QIDQ1836673

Johannes Siemons

Publication date: 1983

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01371410

zbMATH Keywords

orbitstactical decompositionsrank of the incidence matrixregular colourings

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

On orbit closures of groups ⋮ Estimation of means in graphical Gaussian models with symmetries ⋮ On the incidence maps of incidence structures ⋮ Model selection in the space of Gaussian models invariant by symmetry ⋮ Intertwining automorphisms in finite incidence structures ⋮ A note on a lemma of Brauer ⋮ Permutation groups on unordered sets. I ⋮ Orbits on vertices and edges of finite graphs

Cites Work

• Unnamed Item
• Orbits in finite incidence structures
• Feasibility conditions for the existence of walk-regular graphs
• On partitions and permutation groups on unordered sets
• Transitivity of finite permutation groups on unordered sets
• Collineations and Generalized Incidence Matrices
• Dissimilarity Characteristic Theorems for Graphs
• Graphs and Matrices
• On the orbits of collineation groups

This page was built for publication: Automorphism groups of graphs