Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On strongly regular graphs with b1 < 26
-
und
Veröffentlicht/Copyright:
8. Juli 2014
Abstract
Let Γ be a connected edge-regular graph with parameters (v, k, λ), b1 = k−λ−1. It is well known that if b1 = 1, then Γ is a polygon or a complete multipartite graph with colour classes of order 2. The classification of graphs with b1 ≤ 4 is available. Even in the case b1 = 5 the study of graphs offers great difficulties. However, the situation is much easier for strongly regular graphs. In the present paper we classify strongly regular graphs with b1 < 26.
Published Online: 2014-7-8
Published in Print: 2014-7-1
© 2014 by Walter de Gruyter Berlin/Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Masthead
- Density of graphs in which each edge is contained in at least two maximal cliques
- On strongly regular graphs with b1 < 26
- The algorithm for completeness recognizing in function algebra L(ℤ)
- Oscillating random walk and the Hadamard product of rational functions
- On the discrete logarithm problem
- On independent events in families of discrete distributions
Artikel in diesem Heft
- Masthead
- Density of graphs in which each edge is contained in at least two maximal cliques
- On strongly regular graphs with b1 < 26
- The algorithm for completeness recognizing in function algebra L(ℤ)
- Oscillating random walk and the Hadamard product of rational functions
- On the discrete logarithm problem
- On independent events in families of discrete distributions
