On regular and strongly-regular self-complementary graphs
A graph G is called self-complementary, if it is isomorphic to its own complement. The symbol \({\mathcal C}(G)\) denotes the set of permutations of the vertex set V(G) of G which induce isomorphisms of G onto its complement. Further F(G) is the set of all vertices u of G for which there exists \(\sigma\in {\mathcal C}(G)\) such that \(\sigma (u)=u\); N(G) is the set of all edges \(\{\) u,v\(\}\) of G for which there exists \(\sigma\in {\mathcal C}(G)\) such that \(\sigma (u)=v\). The symbol \(\hat F(\)G) denotes the set of all vertices of G which belong to exactly k(k-1) triangles of G, where k is such a number that \(n=4k\) or \(n=4k+1\), where \(n=| V(G)|\). A. Kotzig has proposed the following problems: A. Characterize the subset F(G) of a regular self-complementary graph G. Is it true that \(F(G)=\hat F(G)\) for a regular self-complementary graph G? B. Characterize the set N(G) for a self-complementary graph G. C. Is it true that a regular self-complementary graph G is strongly regular if and only if \(F(G)=V(G)\) and \(N(G)=E(G)?\) In the paper these problems are solved.
- On self-complementary strongly regular graphs
- On regular self-complementary graphs
- scientific article; zbMATH DE number 1279818
- scientific article; zbMATH DE number 840694
- On almost self-complementary graphs
- On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters
- Some results on generalized self-complementary graphs
- On separable self-complementary graphs
- scientific article; zbMATH DE number 3979110
- A Theorem on Permutations in a Finite Field
- scientific article; zbMATH DE number 3777555 (Why is no real title available?)
- scientific article; zbMATH DE number 3618213 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- Parallel concepts in graph theory
- Selbstkomplementäre Graphen
- Solution of the Hamiltonian problem for self-complementary graphs
- On self-complementary strongly regular graphs
- About triangles in a graph and its complement
- Almost self-complementary circulant graphs.
- The enumeration of self-complementary \(k\)-multigraphs
- Self-complementary graphs and Ramsey numbers. I: The decomposition and construction of self-complementary graphs
- Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs
- On self-complementary supergraphs of (n,n)-graphs
- Graphs self-complementary in \(K_ n-e\)
- Strongly edge triangle regular graphs and a conjecture of Kotzig
- On separable self-complementary graphs
- Self-complementary non-uniform hypergraphs
- Extending Potočnik and Šajna's conditions on the existence of vertex-transitive self-complementary \(k\)-hypergraphs
- Some new families of 3-regular self-complementary \(k\)-hypergraphs
- Self-complementary Cayley graphs of extraspecial \(p\)-groups
- New constructions of self-complementary Cayley graphs
- Sylow subgraphs in self-complementary vertex transitive graphs
- Hypomorphy of graphs up to complementation
- Brick assignments and homogeneously almost self-complementary graphs
- Vertex-transitive self-complementary uniform hypergraphs
- Homogeneous factorisations of graphs and digraphs
- Constructing regular self-complementary uniform hypergraphs
- Graphs that accept forced relative self-complementation
- scientific article; zbMATH DE number 1382293 (Why is no real title available?)
- scientific article; zbMATH DE number 1279818 (Why is no real title available?)
- On self-complementary vertex-transitive graphs
- scientific article; zbMATH DE number 1465708 (Why is no real title available?)
- On partitioning the orbitals of a transitive permutation group
- On finite self-complementary metacirculants
- scientific article; zbMATH DE number 840694 (Why is no real title available?)
- Edge-transitive almost self-complementary graphs
- New constructions of self-complementary Cayley graphs
- SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS OF ORDER A PRODUCT OF TWO PRIMES
- Constructions of self-complementary circulants with no multiplicative isomorphisms
- The core of a vertex-transitive complementary prism
- A walk-regular graph, cospectral to its complement, need not be strongly regular
- The automorphism group of a complementary prism
- Coefficients of the matching polynomial of a self-complementary graph
- On almost self-complementary graphs
- Homogeneous factorisations of complete multipartite graphs
- Vertex-transitive self-complementary uniform hypergraphs of prime order
This page was built for publication: On regular and strongly-regular self-complementary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266719)