We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra, V, to the adjacency matrix A of G. Then, by considering convergent series of Hadamard powers of the idempotents of the unique complete system of orthogonal idempotents of V, we establish new feasibility conditions for the existence of strongly regular graphs
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
Let G be a primitive strongly regular Graph of order n and A its matrix of adjacency and let A be th...
We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra,...
Let G be a primitive strongly regular graph G such that the regularity is less than half of the orde...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractThe energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
Strongly regular graphs are regular graphs with the additional property that the number of common ne...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
An approach to the enumeration of feasible parameters for strongly regular graphs is described, base...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
Let G be a primitive strongly regular Graph of order n and A its matrix of adjacency and let A be th...
We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra,...
Let G be a primitive strongly regular graph G such that the regularity is less than half of the orde...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractThe energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
Strongly regular graphs are regular graphs with the additional property that the number of common ne...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is stron...
An approach to the enumeration of feasible parameters for strongly regular graphs is described, base...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
Let G be a primitive strongly regular Graph of order n and A its matrix of adjacency and let A be th...