Skip to search formSkip to main contentSkip to account menu

Strongly regular graph

Known as: SRG, Strongly regular, 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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We report on phenol–pyridine hydrogen-bonded supramolecular polymer–azobenzene complexes made from a newly designed polar… 
Highly Cited
2010
Highly Cited
2010
The dispersion and stability of carbon nanotubes (CNTs) inside a polymer matrix, especially with a high CNT content, are still… 
2007
2007
The dynamic properties of photoinduced alignment and surface relief grating (SRG) formation asafunction ofexcitationwavelength… 
Highly Cited
2006
Highly Cited
2006
This study proposes a new complex system modeling approach by extending a bias-variance trade-off into a bias-variance-complexity… 
2006
2006
This paper deals with the optimal excitation angles of switched reluctance generator (SRG) in order to minimize the losses or to… 
2005
2005
Steel reinforced polymer (SRP) and steel reinforced grout (SRG) are innovative technologies for structural retrofitting developed… 
2002
2002
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every… 
Highly Cited
1985
Highly Cited
1985
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The…