Add to ORKGIn this paper we outline a technique for constructing directed strongly regular graphs by using strongly regular graphs having a "nice" family of intriguing sets. Further, we investigate such a construction method for rank three strongly regular graphs having at most $45$ vertices. Finally, several examples of intriguing sets of polar spaces are provided
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
In this paper we outline a technique for constructing directed strongly regular graphs by using stro...
In this paper we outline a technique for constructing directed strongly regular graphs by using stro...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Abstract. We present a purely combinatorial construction of strongly regular graphs with geometric p...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
2014 Summer.There are many open problems concerning strongly regular graphs: proving non-existence f...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractSome families of directed strongly regular graphs with t=μ are constructed by using antiflag...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the lit...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the lit...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
In this paper we outline a technique for constructing directed strongly regular graphs by using stro...
In this paper we outline a technique for constructing directed strongly regular graphs by using stro...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
Abstract. We present a purely combinatorial construction of strongly regular graphs with geometric p...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
2014 Summer.There are many open problems concerning strongly regular graphs: proving non-existence f...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractSome families of directed strongly regular graphs with t=μ are constructed by using antiflag...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the lit...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the lit...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
Some families of directed strongly regular graphs with t=µ are constructed by using antiflags of -de...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...