Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, µ) , if v is a vertex of G, a subgraph which induced by the set of vertices at distance one denoted by G1(v) and subgraph which induced by the set of vertices at distance two denoted by G2(v). In this paper we introduce and study the subgraph which induced by the set U and denoted by G2(U) where, U can be defined as U = {x: x ∈ V (G), d(a, x) = d(b, x) = 2, and a, b are adjacent vertices}
AbstractIn [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal...
In this paper, we give necessary and sufficient conditions for the existence of two types of strongl...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractLet Γ be a distance-regular graph with (c1,b1) =⋯=(cr,br) ≠ (cr+1,br+1)= ⋯=(c2r,b2r) wherer≥...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractGardiner, A.D., C.D. Godsil, A.D. Hensel and G.F. Royle, Second neighbourhoods of strongly r...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
An important property of strongly regular graphs is that the second subconstituent of any primitive ...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers ...
A graph G is called (r, 2, r(r − 1))-regular if each vertex in the graph G is at a distance one away...
AbstractIn [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal...
In this paper, we give necessary and sufficient conditions for the existence of two types of strongl...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractLet Γ be a distance-regular graph with (c1,b1) =⋯=(cr,br) ≠ (cr+1,br+1)= ⋯=(c2r,b2r) wherer≥...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractBy a square in an undirected graph Γ, we mean a cyclex, y, z, wsuch thatxis not adjacent toz...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractGardiner, A.D., C.D. Godsil, A.D. Hensel and G.F. Royle, Second neighbourhoods of strongly r...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
An important property of strongly regular graphs is that the second subconstituent of any primitive ...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers ...
A graph G is called (r, 2, r(r − 1))-regular if each vertex in the graph G is at a distance one away...
AbstractIn [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal...
In this paper, we give necessary and sufficient conditions for the existence of two types of strongl...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...