P.J. Cameron and D. Stark, A prolific construction of strongly regular graphs with the n-e.c. property, Electron. J. Combin. 9 (2002), no. 1, Research Paper 31. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Graphs With The 3-e.c. Adjacency Property Constructed From .. - Baker, Bonato, Brown (Correct)
....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 of order q , where q is odd. A 3 e.c. graph is formed by taking the points of the partial plane as ....
P.J. Cameron, D. Stark, A prolific construction of strongly regular graphs with the n-e.c. property, submitted to Discrete Math.
On An Adjacency Property Of Almost All Tournaments - Bonato, Cameron Self-citation (Cameron) (Correct)
No context found.
P.J. Cameron and D. Stark, A prolific construction of strongly regular graphs with the n-e.c. property, Electron. J. Combin. 9 (2002), no. 1, Research Paper 31.
On An Adjacency Property Of Almost All Tournaments - Bonato, Cameron Self-citation (Cameron) (Correct)
....countable tournament that is n e.c. for all n 1. The cases n = 1, 2 for graphs were studied in [10, 11, 12] For n 2, few explicit examples of n e.c. graphs are known other than large Paley graphs (see [2, 9] A prolific construction of n e.c. graphs for all n was recently given in [14]. In the present article, we concentrate on the 2 e.c. adjacency property. Note that a tournament is 2 e.c. if the following adjacencies hold: for every pair of vertices, u and v, there are four other vertices: one directed toward both u and v, one directed away from both u and v, one directed ....
P.J. Cameron and D. Stark, A prolific construction of strongly regular graphs with the n-e.c. property, Electron. J. Combin. 9 (2002), no. 1, Research Paper 31, 12 pp.
GRAPHS WITH THE n-E.C. ADJACENCY PROPERTY - Constructed From Affine (Correct)
No context found.
P.J. Cameron, D. Stark, A prolific construction of strongly regular graphs with the n-e.c. property, Electron. J. Combin. 9 (2002) no. 1, Research Paper 31, 12 pp.
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