Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Conference_graph> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Conference_graph abstract "In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated with a symmetric conference matrix, and consequently its order v must be 1 (modulo 4) and a sum of two squares.Conference graphs are known to exist for all small values of v allowed by the restrictions, e.g., v = 5, 9, 13, 17, 25, 29, and (the Paley graphs) for all prime powers congruent to 1 (modulo 4). However, there are many values of v that are allowed, for which the existence of a conference graph is unknown.The eigenvalues of a conference graph need not be integers, unlike those of other strongly regular graphs. If the graph is connected, the eigenvalues are k with multiplicity 1, and two other eigenvalues, each with multiplicity (v − 1)/2.".
- Conference_graph wikiPageID "7769842".
- Conference_graph wikiPageRevisionID "544584513".
- Conference_graph hasPhotoCollection Conference_graph.
- Conference_graph subject Category:Algebraic_graph_theory.
- Conference_graph subject Category:Graph_families.
- Conference_graph type Abstraction100002137.
- Conference_graph type Family108078020.
- Conference_graph type GraphFamilies.
- Conference_graph type Group100031264.
- Conference_graph type Organization108008335.
- Conference_graph type SocialGroup107950920.
- Conference_graph type Unit108189659.
- Conference_graph type YagoLegalActor.
- Conference_graph type YagoLegalActorGeo.
- Conference_graph type YagoPermanentlyLocatedEntity.
- Conference_graph comment "In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated with a symmetric conference matrix, and consequently its order v must be 1 (modulo 4) and a sum of two squares.Conference graphs are known to exist for all small values of v allowed by the restrictions, e.g., v = 5, 9, 13, 17, 25, 29, and (the Paley graphs) for all prime powers congruent to 1 (modulo 4).".
- Conference_graph label "Conference graph".
- Conference_graph label "Grafo de conferência".
- Conference_graph label "Конференсный граф".
- Conference_graph sameAs Grafo_de_conferência.
- Conference_graph sameAs m.026cgqc.
- Conference_graph sameAs Q5159897.
- Conference_graph sameAs Q5159897.
- Conference_graph sameAs Conference_graph.
- Conference_graph wasDerivedFrom Conference_graph?oldid=544584513.
- Conference_graph isPrimaryTopicOf Conference_graph.