Cliques and colorings in generalized Paley graphs and an approach to synchronization
From MaRDI portal
Publication:5251112
DOI10.1142/S0219498815500887zbMath1312.05055arXiv1306.6050OpenAlexW2963117586MaRDI QIDQ5251112
Publication date: 22 May 2015
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6050
primitive permutation groupsPaley graphsaffine groupssynchronizing groupsLovász \(\vartheta\)-function
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Primitive groups (20B15)
Related Items
Gauss sums and the maximum cliques in generalized Paley graphs of square order, Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, Generalised Paley graphs with a product structure, Generalized Paley graphs equienergetic with their complements, Paley-like graphs over finite fields from vector spaces, The EKR-module property of pseudo-Paley graphs of square order
Cites Work
- Groups synchronizing a transformation of non-uniform kernel
- The Černý conjecture for one-cluster automata with prime length cycle
- On generalised Paley graphs and their automorphism groups
- Primitive permutation groups and their section-regular partitions.
- Černý's conjecture and group representation theory
- Synchronizing groups and automata
- Synchronizing Automata and the Černý Conjecture
- THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS
- On the Shannon capacity of a graph
- Transitive simple subgroups of wreath products in product action
- On Orthogonal Matrices