strongly regular graph (Q692823)
From Wikidata
class of graphs in which the number of shared neighbors of two vertices depends only on whether they are adjacent
 stronglyregular graph
Language  Label  Description  Also known as 

English 
strongly regular graph

class of graphs in which the number of shared neighbors of two vertices depends only on whether they are adjacent


Statements
Sitelinks
Wikipedia(4 entries)
 enwiki Strongly regular graph
 frwiki Graphe fortement régulier
 ptwiki Grafo fortemente regular
 ruwiki Сильно регулярный граф