Premium
Pseudo‐random properties of self‐complementary symmetric graphs
Author(s) -
Kisielewicz Andrzej,
Peisert Wojciech
Publication year - 2004
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20035
Subject(s) - mathematics , combinatorics , random graph , indifference graph , discrete mathematics , random regular graph , chordal graph , graph , 1 planar graph
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom