Results 231 to 240 of about 5,433,596 (264)

Almost self-complementary circulant graphs [PDF]

Discrete Mathematics, 2004
An almost self-complementary graph is a graph isomorphic to its complement minus a 1-factor. An almost self-complementary circulant graph is called cyclically almost self-complementary if it has an isomorphic almost complement with the same regular ...
Mateja Sajna, Edward Dobson
exaly   +3 more sources

Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs [PDF]

Discrete Mathematics, 2000
A new method of studying self-complementary graphs, called the decomposition method, is proposed in this paper. Let G be a simple graph. The complement of G, denoted by Ḡ, is the graph in which V(Ḡ)=V(G); and for each pair of vertices u,v in Ḡ,uv∈E(Ḡ)
Xu, Jin, Jin Xu, C.K. Wong, Wong, C.K.
exaly   +5 more sources

More on almost self-complementary graphs [PDF]

Discrete Mathematics, 2009
A graph X is called almost self-complementary if it is isomorphic to one of its almost complements Xc−I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. If I is a perfect matching in Xc and φ:X→Xc−I is an isomorphism, then
Mateja Sajna
exaly   +3 more sources

Equienergetic self-complementary graphs [PDF]

Czechoslovak Mathematical Journal, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Vijayakumar
exaly   +2 more sources

On almost self-complementary graphs

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
exaly   +2 more sources

Hadwiger Numbers of Self-complementary Graphs [PDF]

Graphs and Combinatorics, 2020
6 pages, 4 figures, 1 ...
Elena Pavelescu
exaly   +5 more sources

Brick assignments and homogeneously almost self-complementary graphs [PDF]

Journal of Combinatorial Theory Series B, 2009
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost ...
Primoz Potocnik, Mateja Sajna
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Transitive tournaments and self-complementary graphs

Journal of Graph Theory, 2001
AbstractA simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc.
exaly   +2 more sources

On the structure of self-complementary graphs [PDF]

Electronic Notes in Discrete Mathematics, 2005
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a partition of $V(G)$ into 4 sets $A,B,C,D$ such that there is no edge between $A,B$ and every possible edge between $C,D ...
exaly   +4 more sources

Homogeneously almost self-complementary graphs [PDF]

Electronic Notes in Discrete Mathematics, 2005
Abstract We give necessary and sufficient conditions on n for there to exist a homogeneously almost self-complementary graph of order 2 n for the cases when n is an odd prime power, and when n is twice a prime. We introduce a unified approach to almost self-complementary graphs via brick assignments, and use it to construct several important ...
Primoz Potocnik, Mateja Sajna
exaly   +3 more sources