Strongly edge triangle regular graphs and a conjecture of Kotzig
β Scribed by B.Radhakrishnan Nair; A. Vijayakumar
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 513 KB
- Volume
- 158
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 strongly edge triangle regular. Using these. we continue the analysis of a conjecture of Kotzig on self-complementary graphs.
π SIMILAR VOLUMES
## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangleβfree __r__βregular graph are presented.
Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai-Ito conject