Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group

DOI10.26493/1855-3974.1435.c71zbMath1433.05143arXiv1705.10465OpenAlexW2988166774MaRDI QIDQ5217075

Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.10465

zbMATH Keywords

Cayley graphsvertex transitive graphsdistinguishing chromatic number

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Group actions on combinatorial structures (05E18)

Related Items (1)

A conjecture on bipartite graphical regular representations

Cites Work

• Unnamed Item
• Asymptotic enumeration of vertex-transitive graphs of fixed valency
• Abelian Carter subgroups in finite permutation groups.
• The distinguishing chromatic number
• Finite soluble groups
• Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
• Cayley graphs on abelian groups
• The distinguishing chromatic number of Kneser graphs
• Bounds on the distinguishing chromatic number
• Finite primitive groups and regular orbits of group elements
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• The finite primitive groups with soluble stabilizers, and the edge-primitive s -arc transitive graphs
• χ_D(G), |Aut(G)|, and a variant of the motion lemma

This page was built for publication: Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group