A question about permutation groups: I wonder if someone who is expert in permutation group theory could answer the following question. Let $x \in S_n$ (the symmetric group) be an involution which ...
By the polycirculant conjecture, every vertex-transitive graph is a polycirculant graph (D. Marusic 1981 and D. Jordan 1988). There are two papers that claim to prove this conjecture: 1. A. Golubchik, ...
The following came up in a problem on reconstruction of digraphs. I determined enough about the answer to satisfy the application completely, but still I am curious to know what the complete solution ...
how can i construct a strongly regular graph with parameter $(275,112,30,56)$(Mclaughlin Graph), (105,32,4,12)? I need adjacency matrix of them? I know they are unique.