✦ LIBER ✦

On cyclically K-complementary graphs

✍ Scribed by Jose M. Bernaldez

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 313 KB
Volume: 127
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00467-6

No coin nor oath required. For personal study only.

✦ Synopsis

Let {HiL,.,,,.

,x be an isomorphic factorization of K,. If there is a permutation p on V(K.) such that /j': V(H,)+ V(H,+ ,) is an isomorphism for i= 1,2,

, k-1, then a graph isomorphic to Hi is called a cyclically k-complementary graph. In this paper, some theorems are presented to prove the existence of cyclically k-complementary graphs. It will also give some characterizations of the said graphs and of their permutations.

📜 SIMILAR VOLUMES

On k-complementing permutations of cycli

On k-complementing permutations of cyclically k-complementary graphs

✍ Jose M. Bernaldez 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Let {Hi}i,2 ..... k be an isomorphic factorization of K. where k >/2 and k divides ½n(n -1). If there is a permutation fl on V(K.) such that fl: V(Ht)---~ V(Ht,.,) is an isomorphism for i = 1, 2 ..... k -1 where {Ht,}i = 1,2 ..... k is a rearrangement of {H~}i = 1,2 ..... k then a graph G of order n

Cycles through edges in cyclically k–con

Cycles through edges in cyclically k–connected cubic graphs

✍ William McCuaig 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 247 KB

McCuaig, W., Cycles through edges in cyclically k-connected cubic graphs

Rao's conjecture on self-complementary g

Rao's conjecture on self-complementary graphs with K-factors

✍ Kiyoshi Ando 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract Rao posed the following conjecture, “Let G be a self‐complementary graph of order __p__, π = (d~1~ … dp) be its degree sequence. Then G has a k‐factor if and only if π − k, = (d1 − k, … dP − k) is graphical.” We construct a family of counterexamples for this conjecture for every k ⩾ 3.

On regular self-complementary graphs

✍ Nora Hartsfield 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

A 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.

On strongly regular self - complementary

On strongly regular self - complementary graphs

✍ Sergio Ruiz 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

## Abstract It 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].

On generic forms of complementary graphs

✍ J.W. Moon; S.D. Bedrosian 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Each graph may be associated with a certainfunction called its genericform. If one knows the generic forms of given graphs, then one can easily determine the number of spanning trees in graphs obtained from a complete multi-graph either (1) by adding, or (2) by deleting the edges of disjoint copies