论文信息 - More About Two-Graphs

More About Two-Graphs

Publisher Summary This chapter describes two graphs. The notion of a regular two-graph was proposed by G. Higman as a setting for the 2-transitive representation for certain simple groups. This idea was worked out by Taylor. It turned out that strong relations exist with the switching of graphs. A two-graph (V, ) consists of a set V (the vertices) and a collection of triples of vertices (the odd triples), such that for each 4 vertices the number of odd triples is even. In a regular two-graph, each pair of vertices is in a constant number of odd triples.

J. J. Seidel | J. Seidel

[1] Zoltán Füredi,et al. An exact result for 3-graphs , 1984, Discret. Math..

[2] Peter J. Cameron,et al. Cohomological aspects of two-graphs , 1977 .

[3] Nicolas Bourbaki,et al. Groupes et algèbres de Lie , 1971 .

[4] D. E. Taylor. Regular 2‐Graphs , 1977 .

[5] H. Coxeter,et al. Generators and relations for discrete groups , 1957 .

[6] N. J. A. Sloane,et al. TWO-GRAPHS, SWITCHING CLASSES AND EULER GRAPHS ARE EQUAL IN NUMBER* , 1975 .

[7] Avraham A. Melkman. The distance of a subspace of Rm from its axes and n-widths of octahedra , 1984 .

[8] J. J. Seidel,et al. Two-graphs, related groups, and root systems , 1990 .

[9] Willem H. Haemers,et al. Regular 2-Graphs and Extensions of Partial Geometries , 1991, Eur. J. Comb..

[10] J. J. Seidel,et al. Equilateral point sets in elliptic geometry , 1966 .

[11] Spaces with large projection constants , 1985 .

[12] Aart Blokhuis,et al. Characterization Theorems for Zara Graphs , 1989, Eur. J. Comb..

[13] J. Seidel,et al. Line graphs, root systems, and elliptic geometry , 1976 .

[14] Arnold Neumaier. Completely regular twographs , 1982 .