Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density

DOI10.26493/2590-9770.1395.A37MaRDI QIDQ5045282zbMATHOpenAlexFDO

Authors Wilfried Imrich, Thomas Lachmann, Thomas W. Tucker, Gundelinde Maria Wiegel

Publication date 4 November 2022

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/2590-9770.1395.a37

zbMATH Keywords

automorphismsinfinite graphsdistinguishing numberasymmetrizing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Recommendations

• The cost of distinguishing graphs
• Infinite graphs with finite 2-distinguishing cost
• Vertex transitive graphs \(G\) with \(\chi_D (G)>\chi(G)\) and small automorphism group
• Distinguishing numbers of finite 4-valent vertex-transitive graphs
• Distinguishability of infinite groups and graphs

Cites work

• scientific article; zbMATH DE number 3873360 (Why is no real title available?)
• scientific article; zbMATH DE number 14903 (Why is no real title available?)
• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 5244599 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3046496 (Why is no real title available?)
• A One-Regular Graph of Degree Three
• A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
• A graph which is edge transitive but not arc transitive
• Asymmetric trees with two prescribed degrees
• Asymmetrising sets in trees
• Asymmetrization of infinite trees
• Distinguishing density and the distinct spheres condition
• Distinguishing graphs of maximum valence 3
• Fixed elements of infinite trees
• Hamiltonicity of cubic Cayley graphs
• Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive Graphs
• Infinite graphs with finite 2-distinguishing cost
• Infinite motion and 2-distinguishability of graphs and groups
• On groups with no regular orbits on the set of subsets
• On the Symmetry of Cubic Graphs
• Planarity and duality of finite and infinite graphs
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Regular groups of automorphisms of cubic graphs
• Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method
• Similarity and asymmetrization of trees
• Small label classes in 2-distinguishing labelings
• Symmetric cubic graphs of small girth
• Symmetry breaking in graphs
• The automorphism groups of some cubic Cayley graphs
• Topics in graph automorphisms and reconstruction
• Trivial Set-Stabilizers in Finite Permutation Groups
• Vertex and Edge Transitive, but not 1-Transitive, Graphs

Cited in

(2)

• The cost of distinguishing graphs
• Distinguishing graphs of maximum valence 3

This page was built for publication: Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045282)