Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kawamura, Kazuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jerzy Płonka (1982)
Časopis pro pěstování matematiky
Similarity:
Lepovic, Mirko (2011)
Serdica Mathematical Journal
Similarity:
2010 Mathematics Subject Classification: 05C50. We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent vertices i and j, and |SiЗSj| = q for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let l1 = r, l2 and l3 be the distinct eigenvalues of a connected strongly regular graph. Let...