Bonato, A., Holzmann, W. H., Kharaghani, H., Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic J. Combinatorics, 8(1) (2001), #R1, 9pp. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Prolific Construction of Strongly Regular Graphs With the.. - Cameron, Stark (2 citations) (Correct)
....of a prime. The vertices of the Paley graph P q are the elements of F q and there is an edge between two vertices x and y if and only if x y is a square in F q . The Paley graphs are n e.c. whenever q n 2 2 2n 2 ; see Bollob as and Thomason [3] Recently Bonato, Holzmann and Kharaghani [4] have used Hadamard matrices to construct new 3 e.c. graphs. Even more recently, D. G. Fon Der Flaass [6] has found prolific constructions of strongly regular graphs using affine designs. He points out that some of these constructions appeared in Wallis [10] His main construction appears as ....
Bonato, A., Holzmann, W. H., Kharaghani, H., Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic J. Combinatorics, 8(1) (2001), #R1, 9pp. 12
A Prolific Construction of Strongly Regular Graphs With the.. - Cameron, Stark (2 citations) (Correct)
....of a prime. The vertices of the Paley graph P q are the elements of F q and there is an edge between two vertices x and y if and only if x y is a square in F q . The Paley graphs are n e.c. whenever q n 2 2 2n 2 ; see Bollob as and Thomason [3] Recently Bonato, Holzmann and Kharaghani [4] have used Hadamard matrices to construct new 3 e.c. graphs. Even more recently, D. G. Fon Der Flaass [6] has found prolific constructions of strongly regular graphs using affine designs. He points out that some of these constructions appeared in Wallis [10] His main construction appears as ....
Bonato, A., Holzmann, W. H., Kharaghani, H. (2001) Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Elec. J. Comb., 8 R1, 9pp.
GRAPHS WITH THE n-E.C. ADJACENCY PROPERTY - Constructed From Affine Self-citation (Bonato) (Correct)
No context found.
A. Bonato, W.H. Holzmann, H. Kharaghani, Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electron. J. Combin. 8 (2001) No. 1, 9 pp.
Graphs With The 3-e.c. Adjacency Property Constructed From .. - Baker, Bonato, Brown Self-citation (Bonato) (Correct)
....and phrases. graph, geometry, adjacency property, n e.c. graph, a#ne plane. The first two authors gratefully acknowledge support from Natural Science and Engineering Research Council of Canada (NSERC) research grants. vertices. Constructions of 3 e.c. graphs using Hadamard matrices were given in [9]. Recent constructions using probability theory of many non isomorphic n e.c. graphs are given in [12] In the present article, new 3 e.c. graphs are constructed using finite a#ne planes. In particular, we consider partial planes formed by deleting exactly half the parallel classes of a#ne planes ....
A. Bonato, W.H. Holzmann, H. Kharaghani, Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electron. J. Combin. 8 (2001) no. 1, 9 pp.
A Prolific Construction of Strongly Regular Graphs With the.. - Peter Cameron And (2 citations) (Correct)
No context found.
Bonato, A., Holzmann, W. H., Kharaghani, H., Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic J. Combinatorics, 8(1) (2001), #R1, 9pp.
Unknown - Construction Of Strongly (Correct)
No context found.
Bonato, A., Holzmann, W. H., Kharaghani, H., Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic J. Combinatorics, 8(1) (2001), #R1, 9pp.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC