Add to ORKGA simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs with no triangles such that the second subconstituent is also strongly regular. The method also provides an effective means of listing feasible parameters for such graphs
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. W...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
The feasibility conditions obtained in a previous report are refined, and used to determine several ...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
An approach to the enumeration of feasible parameters for strongly regular graphs is described, base...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, µ) , ...
AbstractThe concepts of strongly vertex triangle regular graphs and strongly edge triangle regular g...
In this paper, we prove that any strongly regular graph with μ = 1 satisfies k ≥ (λ + 1)(λ...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any st...
AbstractThe possible existence of 16 parameter sets for strongly regular graphs with 100 or less ver...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. W...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
The feasibility conditions obtained in a previous report are refined, and used to determine several ...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
An approach to the enumeration of feasible parameters for strongly regular graphs is described, base...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, µ) , ...
AbstractThe concepts of strongly vertex triangle regular graphs and strongly edge triangle regular g...
In this paper, we prove that any strongly regular graph with μ = 1 satisfies k ≥ (λ + 1)(λ...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
In this paper we prove that any strongly regular graph with μ=1 satisfies k ≥(λ +1)(λ +2) and any st...
AbstractThe possible existence of 16 parameter sets for strongly regular graphs with 100 or less ver...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. W...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...