✦ LIBER ✦

Pseudo-random properties of self-complementary symmetric graphs

✍ Scribed by Andrzej Kisielewicz; Wojciech Peisert

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 74 KB
Volume: 47
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20035

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Self-complementary symmetric graphs

✍ Hong Zhang 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract The class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.

All Self-Complementary Symmetric Graphs

✍ Wojciech Peisert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 153 KB

In 1992, H. Zhang (J. Graph Theory 16, 1-5), using the classification of finite simple groups, gave an algebraic characterisation of self-complementary symmetric graphs. Yet, from this characterisation it does not follow whether such graphs, other than the well-known Paley graphs, exist. In this pap

Long cycles in subgraphs of (pseudo)rand

Long cycles in subgraphs of (pseudo)random directed graphs

✍ Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every 08γ81/2 we find a constant __c__ = __c__(γ) such that the following holds. Let __G__ = (__V, E__) be a (pseudo)random directed graph on __n__ vertice

A graph and its complement with specifie

A graph and its complement with specified properties. IV. Counting self-complementary blocks

✍ Jin Akiyama; Frank Harary 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

## Abstract In this series, we investigate the conditions under which both a graph __G__ and its complement G possess certain specified properties. We now characterize all the graphs __G__ such that both __G__ and G have the same number of endpoints, and find that this number can only be 0 or 1 or

Super edge connectivity properties of co

Super edge connectivity properties of connected edge symmetric graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Sharp thresholds for certain Ramsey prop

Sharp thresholds for certain Ramsey properties of random graphs

✍ Ehud Friedgut; Michael Krivelevich 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB