Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Moore_graph> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Moore_graph abstract "In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper boundAn equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Moore graphs were named by Hoffman & Singleton (1960) after Edward F. Moore, who posed the question of describing and classifying these graphs.As well as having the maximum possible number of vertices for a given combination of degree and diameter,Moore graphs have the minimum possible number of vertices for a regular graph with given degree and girth. That is, any Moore graph is a cage (Erdõs, Rényi & Sós 1966). The formula for the number of vertices in a Moore graph can be generalized to allow a definition of Moore graphs with even girth as well as odd girth, and again these graphs are cages.".
- Moore_graph thumbnail Petersen-as-Moore.svg?width=300.
- Moore_graph wikiPageExternalLink 6123.
- Moore_graph wikiPageExternalLink ipm.pdf.
- Moore_graph wikiPageExternalLink 1966-06.pdf.
- Moore_graph wikiPageID "4112719".
- Moore_graph wikiPageRevisionID "602148837".
- Moore_graph hasPhotoCollection Moore_graph.
- Moore_graph title "Hoffman-Singleton Theorem".
- Moore_graph title "Moore Graph".
- Moore_graph urlname "Hoffman-SingletonTheorem".
- Moore_graph urlname "MooreGraph".
- Moore_graph subject Category:Graph_families.
- Moore_graph subject Category:Regular_graphs.
- Moore_graph type Abstraction100002137.
- Moore_graph type Family108078020.
- Moore_graph type GraphFamilies.
- Moore_graph type Group100031264.
- Moore_graph type Organization108008335.
- Moore_graph type SocialGroup107950920.
- Moore_graph type Unit108189659.
- Moore_graph type YagoLegalActor.
- Moore_graph type YagoLegalActorGeo.
- Moore_graph type YagoPermanentlyLocatedEntity.
- Moore_graph comment "In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper boundAn equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Moore graphs were named by Hoffman & Singleton (1960) after Edward F.".
- Moore_graph label "Graphe de Moore".
- Moore_graph label "Moore graph".
- Moore_graph sameAs Graphe_de_Moore.
- Moore_graph sameAs m.0bjsgk.
- Moore_graph sameAs Q3115522.
- Moore_graph sameAs Q3115522.
- Moore_graph sameAs Moore_graph.
- Moore_graph wasDerivedFrom Moore_graph?oldid=602148837.
- Moore_graph depiction Petersen-as-Moore.svg.
- Moore_graph isPrimaryTopicOf Moore_graph.
