2010 Mathematics Subject Classification: 05C50.We say that a regular graph G of order n and degree r і 1 (which is not the complete graph) is strongly regular if there exist non-negative integers t and q such that |SiЗSj| = t for any two adjacent vertices i and j, and |SiЗSj| = q for any two distinct non-adjacent vertices i and j, where Sk denotes the neighborhood of the vertex k. Let l1 = r, l2 and l3 be the distinct eigenvalues of a connected strongly regular graph. Let m1 = 1, m2 and m3 denote the multiplicity of r, l2 and l3, respectively. We here describe the parameters n, r, t and q for strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 2, 3, 4
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are onl...
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any st...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are onl...
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any st...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are onl...
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any st...