All self-complementary symmetric graphs
From MaRDI portal
Recommendations
Cites work
- Automorphism groups of designs
- Characterization of self-complementary symmetric digraphs
- Direct product and uniqueness of automorphism groups of graphs
- Finite Permutation Groups and Finite Simple Groups
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- scientific article; zbMATH DE number 3125713 (Why is no real title available?)
- scientific article; zbMATH DE number 3943825 (Why is no real title available?)
- scientific article; zbMATH DE number 192892 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- On edge transitive circulant graphs
- On self-complementary strongly regular graphs
- On the Classification of Symmetric Graphs with a Prime Number of Vertices
- On the Number of Self-Complementary Graphs and Digraphs
- Selbstkomplementäre Graphen
- Self-complementary graphs
- Self-complementary symmetric graphs
- Solvable Primitive Permutation Groups of Low Rank
- Solvable, flag-transitive, rank 3 collineation groups
- The Affine Permutation Groups of Rank Three
- The Flag-Transitive Collineation Groups of the Finite Desarguesian Affine Planes
Cited in
(63)- Some results on skew Hadamard difference sets
- Homogeneous factorisations of complete graphs with edge-transitive factors
- On generalised Paley graphs and their automorphism groups
- The critical groups of the Peisert graphs
- Non-commutative association schemes of rank 6 with affine subschemes
- Direct product of automorphism groups of colored graphs
- Special LCD codes from Peisert and generalized Peisert graphs
- Hamming graphs and special LCD codes
- A classification of one-dimensional affine rank three graphs
- The EKR-module property of pseudo-Paley graphs of square order
- Ample simplicial complexes
- On maximal cliques of Cayley graphs over fields
- Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
- A new family of Hadamard matrices of order 4 (2 q^2+1)
- Constructions of almost difference sets from finite fields
- Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets
- Pseudo-Paley graphs and skew Hadamard difference sets from presemifields
- Iterated open neighborhood graphs and generalizations
- Graphical complexity of products of permutation groups
- Sylow subgraphs in self-complementary vertex transitive graphs
- Brick assignments and homogeneously almost self-complementary graphs
- Homogeneous factorisations of graphs and digraphs
- Shannon capacity and the categorical product
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order
- Automorphism groups of self-complementary vertex-transitive graphs
- On the normal structure of noncommutative association schemes of rank 6
- The graphical complexity of direct products of permutation groups
- Paley and the Paley Graphs
- Direct products of automorphism groups of graphs
- Totally symmetric colored graphs
- Self-complementary symmetric graphs
- The spectral characterizations of the connected multicone graphs K_w L H S and K_w L G Q(3, 9)
- On partitioning the orbitals of a transitive permutation group
- On geodesic transitive graphs
- On finite self-complementary metacirculants
- scientific article; zbMATH DE number 819125 (Why is no real title available?)
- On conjugacy of diagonalizable integral matrices
- On 2-closures of rank 3 groups
- Edge-transitive almost self-complementary graphs
- On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters
- New constructions of self-complementary Cayley graphs
- The spectral determination of the connected multicone graphs K_w rC_S
- The spectral determinations of the join of two friendship graphs
- SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS OF ORDER A PRODUCT OF TWO PRIMES
- All totally symmetric colored graphs
- Self-complementary graphs
- Maximality of subfields as cliques in Cayley graphs over finite fields
- The core of a vertex-transitive complementary prism
- On graph norms for complex‐valued functions
- Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\)
- Number of complete subgraphs of peisert graphs and finite field hypergeometric functions
- Weyl tensors, strongly regular graphs, multiplicative characters, and a quadratic matrix equation
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
- The automorphism group of a complementary prism
- Distribution of power residues over shifted subfields and maximal cliques in generalized Paley graphs
- On the classification of triply transitive strongly regular graphs
- On the twin-width of near-regular graphs
- On the Weisfeiler algorithm of depth-1 stabilization
- The classification of two-distance transitive dihedrants
- \((-2)\)-monohemimorphic graphs
- Cliques in Paley graphs of square order and in Peisert graphs
- Homogeneous factorisations of complete multipartite graphs
- Vertex-transitive self-complementary uniform hypergraphs of prime order
This page was built for publication: All self-complementary symmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938607)
