Can I read On Strongly Regular Graphs with B1 < 26 on EtoBox?
On Strongly Regular Graphs with B1 < 26 by Alexander A. Makhnev; Marina S. Nirova is a Computer Science article available to read on EtoBox.
What is On Strongly Regular Graphs with B1 < 26 about?
Let be a connected edge-regular graph with parameters ( , , ), 1 = --1. It is well known that if 1 = 1, then is a polygon or a complete multipartite graph with colour classes of order 2. The classi cation of graphs with 1 ≤ 4 is available. Even in the case 1 = 5 the study of graphs o ers great di culties. However, the situation is much easier for strongly regular graphs. In the present paper we classify strongly regular graphs with 1 < 26 .
Who reads On Strongly Regular Graphs with B1 < 26?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Alexander A. Makhnev; Marina S. Nirova
- Publisher
- Walter de Gruyter GmbH & Co. KG; Walter de Gruyter GmbH (ISSN 0924-9265)
- Published
- 2014
- Language
- EN
- Field
- Computer Science (Physical Sciences)