Separability number and Schurity number of coherent configurations.
Evdokimov, Sergei, Ponomarenko, Ilia (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.”
Separability number and Schurity number of coherent configurations.
Yet another distance regular graph related to a Golay code.
Soicher, Leonard H. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tetravalent non-normal Cayley graphs of order .
Zhou, Jin-Xin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sharply transitive 1-factorizations of complete multipartite graphs.
Mazzuoccolo, Giuseppe, Rinaldi, Gloria (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tetravalent Arc-Transitive Graphs of Order 3p 2
Mohsen Ghasemi (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p2 is given
New regular partial difference sets and strongly regular graphs with parameters and .
Golemac, Anka, Mandić, Joško, Vučičić, Tanja (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Arc-transitive non-Cayley graphs from regular maps.
Gvozdjak, P., Širáň, J. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Characterization of simple orbit graphs.
Bretto, Alain, Faisant, Alain, Jaulin, Cerasela, Tomanová, Jana (2010)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On the graphs of Hoffman-Singleton and Higman-Sims.
Hafner, Paul R. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: