Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Chang_graphs> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- Chang_graphs abstract "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.".
- Chang_graphs thumbnail Chang_graphs.svg?width=300.
- Chang_graphs wikiPageExternalLink nadia.pdf.
- Chang_graphs wikiPageExternalLink ChangGraphs.html.
- Chang_graphs wikiPageExternalLink Chang.html.
- Chang_graphs wikiPageID "28990313".
- Chang_graphs wikiPageRevisionID "584726968".
- Chang_graphs edges "168".
- Chang_graphs hasPhotoCollection Chang_graphs.
- Chang_graphs imageCaption "The three Chang graphs , and the switching sets generating them from the line graph L".
- Chang_graphs name "Chang graphs".
- Chang_graphs properties Strongly_regular_graph.
- Chang_graphs vertices "28".
- Chang_graphs subject Category:Individual_graphs.
- Chang_graphs subject Category:Regular_graphs.
- Chang_graphs type Abstraction100002137.
- Chang_graphs type Communication100033020.
- Chang_graphs type Graph107000195.
- Chang_graphs type IndividualGraphs.
- Chang_graphs type RegularGraphs.
- Chang_graphs type VisualCommunication106873252.
- Chang_graphs comment "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).".
- Chang_graphs label "Chang graphs".
- Chang_graphs label "Grafos de Chang".
- Chang_graphs label "Grafos de Chang".
- Chang_graphs sameAs Grafos_de_Chang.
- Chang_graphs sameAs Grafos_de_Chang.
- Chang_graphs sameAs m.0dgpmdf.
- Chang_graphs sameAs Q5071699.
- Chang_graphs sameAs Q5071699.
- Chang_graphs sameAs Chang_graphs.
- Chang_graphs wasDerivedFrom Chang_graphs?oldid=584726968.
- Chang_graphs depiction Chang_graphs.svg.
- Chang_graphs isPrimaryTopicOf Chang_graphs.
