Buy Me a Coffee at ko-fi.com

Strongly regular graph

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

Pronunciation
/ˈstrɔŋli ˈrɛɡjələr ɡræf/
/ˈstrɒŋli ˈrɛɡjʊlə ɡrɑːf/