The concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is stro
Automorphisms of Strongly Regular Krein Graphs without Triangles
โ Scribed by A. A. Makhnyov; V. V. Nosov
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 210 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0002-5232
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
## 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