Pseudo-random properties of self-complementary symmetric graphs

DOI10.1002/JGT.20035MaRDI QIDQ3159385zbMATH OpenOpenAlexFDO

Authors Wojciech Peisert, Andrzej Kisielewicz

Publication date 16 February 2005

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20035

zbMATH Keywords

graphrandomcliquesymmetricadjacencyself-complementary

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Pseudo-random graphs
• scientific article; zbMATH DE number 4027516
• Pseudo-random hypergraphs
• Self-complementary symmetric graphs
• Quasirandomness in Graphs
• scientific article; zbMATH DE number 3959485
• On kaleidoscopic pseudo-randomness of finite Euclidean graphs
• scientific article; zbMATH DE number 4099367
• scientific article; zbMATH DE number 840694
• On almost self-complementary graphs

Cites work

• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• CLIQUE NUMBERS OF PALEY GRAPHS
• THE CLIQUE NUMBERS AND CHROMATIC NUMBERS OF CERTAIN PALEY GRAPHS

Cited in

(7)

• Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
• Ample simplicial complexes
• Totally symmetric colored graphs
• The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
• Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\)
• On maximal cliques of Cayley graphs over fields
• Separating rank 3 graphs

This page was built for publication: Pseudo-random properties of self-complementary symmetric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159385)