Pseudo-random properties of self-complementary symmetric graphs
From MaRDI portal
Publication:3159385
DOI10.1002/jgt.20035zbMath1055.05137OpenAlexW4245869229MaRDI QIDQ3159385
Wojciech Peisert, Andrzej P. 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
Related Items (6)
On maximal cliques of Cayley graphs over fields ⋮ Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields ⋮ Separating rank 3 graphs ⋮ Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\) ⋮ Totally symmetric colored graphs ⋮ Ample simplicial complexes
Cites Work
This page was built for publication: Pseudo-random properties of self-complementary symmetric graphs
