Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Degree_diameter_problem> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Degree_diameter_problem abstract "In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is bounded above by the Moore bound; for 1 < k and 2 < d only the Petersen graph, the Hoffman-Singleton graph, and maybe a graph of diameter k = 2 and degree d = 57 attain the Moore bound. In general the largest degree-diameter graphs are much smaller in size than the Moore bound.".
- Degree_diameter_problem wikiPageExternalLink Diameter_Problem.
- Degree_diameter_problem wikiPageExternalLink ds14.pdf.
- Degree_diameter_problem wikiPageExternalLink 2315106.
- Degree_diameter_problem wikiPageExternalLink ibmrd0405H.pdf.
- Degree_diameter_problem wikiPageID "19726161".
- Degree_diameter_problem wikiPageRevisionID "603566674".
- Degree_diameter_problem hasPhotoCollection Degree_diameter_problem.
- Degree_diameter_problem subject Category:Computational_problems_in_graph_theory.
- Degree_diameter_problem type Abstraction100002137.
- Degree_diameter_problem type Attribute100024264.
- Degree_diameter_problem type ComputationalProblemsInGraphTheory.
- Degree_diameter_problem type Condition113920835.
- Degree_diameter_problem type Difficulty114408086.
- Degree_diameter_problem type Problem114410605.
- Degree_diameter_problem type State100024720.
- Degree_diameter_problem comment "In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is bounded above by the Moore bound; for 1 < k and 2 < d only the Petersen graph, the Hoffman-Singleton graph, and maybe a graph of diameter k = 2 and degree d = 57 attain the Moore bound.".
- Degree_diameter_problem label "Degree diameter problem".
- Degree_diameter_problem label "度-直徑問題".
- Degree_diameter_problem sameAs m.04mxk5q.
- Degree_diameter_problem sameAs Q5251835.
- Degree_diameter_problem sameAs Q5251835.
- Degree_diameter_problem sameAs Degree_diameter_problem.
- Degree_diameter_problem wasDerivedFrom Degree_diameter_problem?oldid=603566674.
- Degree_diameter_problem isPrimaryTopicOf Degree_diameter_problem.