More About Two-Graphs-Reference-Cited by-同舟云学术

More About Two-Graphs

Published:1992 Issue: Volume: Page:297-307
ISSN:0167-5060
Container-title:Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
language:
Short-container-title:

Author:

Seidel J.J.

Publisher

Elsevier

Reference24 articles.

1. A. Blokhuis, A.E. Brouwer, Uniqueness of a Zara graph on 126 points and nonexistence of a completely regular two-graph on 288 points, Papers dedicated to J. J. Seidel (P. J. de Doelder, J. de Graaf, J. H. van Lint, eds.), Techn. Univ. Eindhoven report 84-WSK-03, 1984, 6–19.

2. Characterization theorems for Zara graphs;Blokhuis;Europ. J. Combin.,1989

3. N. Bourbaki, Groupes et algebres de Lie, Ch. IV, V, VI, Hermann, 1968.

4. A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance Regular Graphs, Springer, 1989.

5. F. C. Bussemaker, R. A. Mathon, J. J. Seidel, Tables of two-graphs, Combinatorics and graph theory, L.N.M. (S. B. Rao, ed.), vol. 885, Springer, 1981, 70 112; Report 79–WSK-05, Techn Univ. Eindhoven, 1979.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Doubly transitive lines I: Higman pairs and roux;Journal of Combinatorial Theory, Series A;2022-01

2. Weighted association schemes, fusions, and minimal coherent closures;Journal of Algebraic Combinatorics;2014-09-09

3. Type-II matrices in weighted Bose–Mesner algebras of ranks 2 and 3;Journal of Algebraic Combinatorics;2009-12-04

4. Complexity of Hypergraph Coloring and Seidel’s Switching;Graph-Theoretic Concepts in Computer Science;2003

5. Once more about 80 Steiner triple systems on 15 points;Journal of Statistical Planning and Inference;1998-09