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)

Related topics

Related topics

20 relations
Adjacency matrixClaw-free graphComplement graphConference graph

Broader (1)

Algebraic graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Surface-Relief Gratings and Stable Birefringence Inscribed Using Light of Broad Spectral Range in Supramolecular Polymer-Bisazobenzene Complexes
We report on phenol–pyridine hydrogen-bonded supramolecular polymer–azobenzene complexes made from a newly designed polar… 
2012
2012
Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs
We investigate the quantum dynamics of particles on graphs (“quantum random walks”), with the aim of developing quantum… 
Highly Cited
2010
Highly Cited
2010
Surfactant-assisted processing of polyimide/multiwall carbon nanotube nanocomposites for microelectronics applications
The dispersion and stability of carbon nanotubes (CNTs) inside a polymer matrix, especially with a high CNT content, are still… 
2007
2007
Control of Photodynamic Motions of Azobenzene‐Derivative Polymers by Laser Excitation Wavelength
The dynamic properties of photoinduced alignment and surface relief grating (SRG) formation asafunction ofexcitationwavelength… 
2006
2006
A Double-Stage Genetic Optimization Algorithm for Portfolio Selection
In this study, a double-stage genetic optimization algorithm is proposed for portfolio selection. In the first stage, a genetic… 
2005
2005
BOND PERFORMANCE OF STEEL REINFORCED POLYMER AND STEEL REINFORCED GROUT
Steel reinforced polymer (SRP) and steel reinforced grout (SRG) are innovative technologies for structural retrofitting developed… 
2002
2002
Strongly Regular Graph
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… 
2000
2000
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph $\Gamma$ with diameter $d$ is strongly distance-regular if $\Gamma$ is distance-regular and its distance-$d$ graph… 
Highly Cited
1985
Highly Cited
1985
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The… 
1977
1977
Remarks on nonlinear ergodic theory
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)