Strongly regular graph

Known as: Strongly regular graphs 
In graph theory, a strongly regular graph is defined as follows. Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2018
0204019702018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We prove that if G and H are primitive strongly regular graphs with the same parameters and φ is a homomorphism from G to H, then… (More)
Is this relevant?
2008
2008
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only… (More)
Is this relevant?
Review
2008
Review
2008
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for… (More)
Is this relevant?
2001
2001
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly… (More)
  • figure 1
Is this relevant?
Review
2001
Review
2001
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently… (More)
Is this relevant?
1999
1999
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1998
1998
We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set… (More)
Is this relevant?
1996
1996
A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called… (More)
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We demonstrate that isomorphism of strongly regular graphs may be tested in time n~m’’’’ogm). Our approach is to analyze the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Spreads of finite symplectic, orthogonal and unitary vector spaces are used to construct new strongly regular graphs having the… (More)
Is this relevant?