𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jin Xu; C.K. Wong

Book ID
108315486
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
431 KB
Volume
223
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of self-complementary graphs and
A class of self-complementary graphs and lower bounds of some ramsey numbers
✍ C. R. J. Clapham 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num

On the construction of the self-compleme
On the construction of the self-complementary graphs on 12 nodes
✍ Marg Kropar; Ronald C. Read 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 807 KB

## Abstract We 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 Srid

Pseudo-random properties of self-complem
Pseudo-random properties of self-complementary symmetric graphs
✍ Andrzej Kisielewicz; Wojciech Peisert 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

## Abstract There are some results in the literature showing that Paley graphs behave in many ways like random graphs __G__(__n__, 1/2). In this paper, we extend these results to the other family of self‐complementary symmetric graphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 310–316, 2004