Chang graphs

From Wikipedia, the free encyclopedia
Chang graphs

The three Chang graphs (right), and the switching sets generating them from the line graph L(K8) (green, left)
Vertices 28
Edges 168
Properties Strongly regular

In the mathematical field of graph theory, the Chang graphs are a set of three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the same parameters and spectra as the line graph L(K8) of the complete graph K8.

Each of these three graphs may be obtained by graph switching from L(K8). That is, a subset S of the vertices of L(K8) is chosen, each edge that connects a vertex in S with a vertex not in S is deleted from L(K8), and an edge is added for each pair of vertices (with again one in S and one not in S) that were not already connected by an edge. Among the graphs that can be generated in this way, three of them are the Chang graphs.

The Chang graphs are named after Chang Li-Chien, who proved that, with only these exceptions, every line graph of a complete graph is uniquely determined by its parameters as a strongly regular graph.[1]

See also

  • Shrikhande graph, a similar exception to the uniqueness of the strongly regular graphs L(Kn,n)

References

  1. ↑ Chang Li-Chien (1959), "The uniqueness and non-uniqueness of the triangular association schemes", Science Record (Peking), New. Ser. 3: 604–613 .

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.