Content deleted Content added
m link bipartite graph using Find link |
|||
Line 57:
* The [[Clebsch graph]] is an srg(16, 5, 0, 2).
* The [[Shrikhande graph]] is an srg(16, 6, 2, 2) which is not a [[distance-transitive graph]].
* The ''n'' × ''n'' square [[rook's graph]], i.e., the line graph of a balanced complete [[bipartite graph]] ''K''<sub>''n'',''n''</sub>, is an srg(''n''<sup>2</sup>, 2''n'' − 2, ''n'' − 2, 2). The parameters for {{nowrap|''n'' {{=}} 4}} coincide with those of the Shrikhande graph, but the two graphs are not isomorphic.
* The [[line graph]] of a complete graph ''K<sub>n</sub>'' is an <math display="inline">\operatorname{srg}\left(\binom{n}{2}, 2(n - 2), n - 2, 4\right)</math>.
* The [[Chang graphs]] are srg(28, 12, 6, 4), the same as the line graph of ''K''<sub>8</sub>, but these four graphs are not isomorphic.
| |||