Results 261 to 270 of about 5,608,609 (280)
Some of the next articles are maybe not open access.
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
On Self-complementary of Circulant Graphs
2011a graph G is self-complementary if it is isomorphic to its complement \(\overline{G}\). If G is a regular self-complementary graph, then G is connected and has n = 4k +1 vertices and degree r = 2k, where n,k are positive integers. In this paper, we investigate the existence condition for self-complementary of circulant graphs with order n = 4k +1 ...
openaire +1 more source
Self-complementary graphs with minimum degree two.
Ars Comb., 2002A self-complementary graph is a graph which is isomorphic to its complement. The paper studies such graphs with minimum degree exactly equal to 2. Four structures of a graph are considered and it is proved that such a graph has one of those structures.
Kiyoshi Ando, Atsuhiro Nakamoto
openaire +2 more sources
On finite graphs that are self-complementary and vertex-transitive
Australas. J Comb., 1998The author gives a brief survey of known results about vertex-transitive self-complementary graphs. He also introduces several new problems.
openaire +2 more sources
Integrative Oncology: Complementary Therapies for Pain, Anxiety, and Mood Disturbance
Ca-A Cancer Journal for Clinicians, 2005Gary Deng, B R Cassileth
exaly
On the Number of Self-Complementary Graphs and Digraphs
Journal of the London Mathematical Society, 1963openaire +1 more source
Non-Cayley-isomorphic self-complementary circulant graphs
Journal of Graph Theory, 2000Valery Liskovets, Reinhard Pöschel
exaly