AbstractThe concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is strongly edge triangle regular. Using these, we continue the analysis of a conjecture of Kotzig on self-complementary graphs
A regular clique in a regular graph is a clique such that every vertex outside of the clique is adja...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractThe concepts of strongly vertex triangle regular graphs and strongly edge triangle regular g...
AbstractIn this paper we solve 3 of the 6 problems of A. Kotzig on regular and strongly-regular self...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
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 ...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
We consider the class ER(n, d, lambda) of edge-regular graphs for some n > d > lambda, i.e., graphs ...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractAs an application of Jacobi's identity on complementary minors, one can exhibit a simple exp...
A regular clique in a regular graph is a clique such that every vertex outside of the clique is adja...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractThe concepts of strongly vertex triangle regular graphs and strongly edge triangle regular g...
AbstractIn this paper we solve 3 of the 6 problems of A. Kotzig on regular and strongly-regular self...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
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 ...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
We consider the class ER(n, d, lambda) of edge-regular graphs for some n > d > lambda, i.e., graphs ...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractAs an application of Jacobi's identity on complementary minors, one can exhibit a simple exp...
A regular clique in a regular graph is a clique such that every vertex outside of the clique is adja...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...