In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the
The 2-extendability of strongly regular graphs
β Scribed by Dingjun Lou; Qingwei Zhu
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 362 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208β217, 2003; Published online in Wiley InterScience (www.interscience.wil
## Some antipodal distance-regular graphs of diameter three arise as the graph induced by the vertices at distance two from a given vertex in a strongly regular graph. We show that if every vertex in a strongly regular graph G has this property, then G is the noncollinearity graph of a special typ
By a square in an undirected graph β« , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that β« is a strongly regular graph with Ο 2 , and assume that β« does not contain a square . Pick any vertex x of β« and let β« Π denote the induced subgraph on the
## Abstract In the geometric setting of the embedding of the unitary group __U__~__n__~(__q__^2^) inside an orthogonal or a symplectic group over the subfield __GF__(__q__) of __GF__(__q__^2^), __q__ odd, we show the existence of infinite families of transitive twoβcharacter sets with respect to hy