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.
2014
2014
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly… 
2014
2014
We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for… 
2011
2011
This paper presents an extension of the generalized stochastic Petri net (GSPN) formalism that enables the computation of first… 
2010
2010
This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini… 
Highly Cited
2007
Highly Cited
2007
Ubiquitous tracking setups, covering large tracking areas with many heterogeneous sensors of varying accuracy, require dedicated… 
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… 
2000
2000
A graph $\Gamma$ with diameter $d$ is strongly distance-regular if $\Gamma$ is distance-regular and its distance-$d$ graph… 
1995
1995
This paper presents the super relation graph (SRG) method for extracting prismatic features from the CAD boundary representation… 
1993
1993
Implicit-function theorems for generalized equations play an important role in many applications, especially in the stability and…