Questions tagged [strongly-regular-graph]
A strongly regular graph $G$ is a regular graph with the following additional property: there exist two integers $\lambda$ and $\mu$ such that every two adjacent vertices have $\lambda$ common neighbors and every two non-adjacent vertices have $\mu$ common neighbors.
5
questions with no upvoted or accepted answers
8
votes
0
answers
360
views
A question related to Conways 99 graph problem
I have observed that the number of triangles $\frac{vk}{6}$ of a strongly regular graph with parameters $(v,k,1,2)$ is given by the coefficient $2(k-1)$ in the molien series of the "4-D extraspecial ...
4
votes
0
answers
126
views
"Neighborhood-Bounded" regular graphs
Lately I have been interested in questions surrounding strongly regular graphs, and came across this question that I have been struggling to make progress on. (For the sake of being explicit, a graph $...
2
votes
0
answers
162
views
Articles on (Strongly Regular) Graphs and Covering Arrays / Covering Designs?
In their book "Algebraic Graph Theory" Godsil and Royle mention the connection of strongly regular graphs with latin squares and thus Orthogonal Arrays (Chapter 10.4). There seems not to be much ...
2
votes
1
answer
322
views
What's the worst case for strongly regular graph's isomorphism algorithm?
A new algorithm of Graph Isomorphism is invented by PCT/CN2020/134861, roughly speaking time complexity $\leqslant5n^2$ except for regular graph, automorphism group can be known as by-product. Peer ...
1
vote
0
answers
61
views
Commutative Schur ring over non-abelian group
Is there a commutative (or even symmetric) Schur ring $S\subset\mathbb{C}G$ over a non-abelian group $G$, which is not isomorphic (preserving both the products) to a Schur ring $S'\subset\mathbb{C}G'$ ...