From Surf Wiki (app.surf) — the open knowledge base
Chang graphs
| Field | Value |
|---|---|
| name | Chang graphs |
| vertices | 28 |
| edges | 168 |
| diameter | 2 |
| radius | 2 |
| girth | 3 |
| automorphisms | 96360384 |
| properties | Strongly regular |
In the mathematical field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the same parameters and spectrum as the line graph L(K8) of the complete graph K**8.
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.
References
References
- Chang Li-Chien. (1959). "The uniqueness and non-uniqueness of the triangular association schemes". Science Record (Peking).
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Chang graphs — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report