Results 241 to 250 of about 5,433,596 (264)
Some of the next articles are maybe not open access.
Enumeration of Bipartite Self-Complementary Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Makoto Ueno, Shinsei Tazawa
openaire +1 more source
Self‐complementary symmetric graphs
Journal of Graph Theory, 1992AbstractThe class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
openaire +1 more source
On regular self‐complementary graphs
Journal of Graph Theory, 1987AbstractA regular self‐complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
openaire +2 more sources
On self-complementary supergraphs of (n, n)-graphs
Electronic Notes in Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Pawel Wojda +2 more
exaly +4 more sources
On strongly regular self ‐ complementary graphs
Journal of Graph Theory, 1981AbstractIt is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
openaire +1 more source
Edge-transitive almost self-complementary graphs
Journal of Combinatorial Theory Series B, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinxin Zhou
exaly +2 more sources
Self-complementary circulant graphs
Ars Comb., 1999Summary: There exists a self-complementary circulant graph with \(n\) vertices if and only if every prime \(p\) in the prime factorization of \(n\) satisfies \(p \equiv 1\) (mod 4).
Brian Alspach, Joy Morris, V. Vilfred
openaire +2 more sources
Cybernetics, 1986
The paper is mainly concerned with the class K of finite groups defined as follows: \(\Gamma\in K\) if \(\Gamma\) has an automorphism \(\sigma\) and a subset H such that \(\Gamma \setminus \{e\}=H\cup H^{\sigma}\), \(H\cap H^{\sigma}=\emptyset\) and \(h\in H\Rightarrow h^{-1}\in H\).
openaire +1 more source
The paper is mainly concerned with the class K of finite groups defined as follows: \(\Gamma\in K\) if \(\Gamma\) has an automorphism \(\sigma\) and a subset H such that \(\Gamma \setminus \{e\}=H\cup H^{\sigma}\), \(H\cap H^{\sigma}=\emptyset\) and \(h\in H\Rightarrow h^{-1}\in H\).
openaire +1 more source
On the construction of the self‐complementary graphs on 12 nodes
Journal of Graph Theory, 1979AbstractWe briefly describe how we compiled a catalog of all the 720 self‐complementary graphs on 12 nodes. In our first attempt at this compilation one graph was inadvertently omitted. The missing graph was subsequently found by making use of a theoretical formula due to Parthasarathy and Sridharan for counting self‐complementary graphs with given ...
Marg Kropar, Ronald C. Read
openaire +2 more sources
Graph isomorphism and self-complementary graphs
ACM SIGACT News, 1978Marlene J. Colbourn, Charles J. Colbourn
openaire +3 more sources