| http://dbpedia.org/ontology/abstract
|
In graph theory, the degree diameter probl … In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem (excluding the case of degree 2, where the largest graphs are cycles with an odd number of vertices).re cycles with an odd number of vertices).
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://hal.inria.fr/hal-02435539/file/52-BDF81-degreediameter3.pdf +
, https://eldorado.tu-dortmund.de/bitstream/2003/34440/1/S0004501.pdf +
, http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS14 +
, https://www.math.auckland.ac.nz/~conder/symmcubic2048list.txt +
, https://web.archive.org/web/20150110030525/http:/ginger.indstate.edu/ge/DD/index.html +
, http://combinatoricswiki.org/wiki/The_Degree/Diameter_Problem +
, http://portal.acm.org/citation.cfm%3Fid=299331 +
, http://ajc.maths.uq.edu.au/pdf/41/ajc_v41_p063.pdf +
, https://web.archive.org/web/20200928131319/http:/premat.fing.edu.uy/papers/2013/153.pdf +
, http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/67691 +
, https://web.archive.org/web/20160303193729/http:/www.eyal.com.au/wiki/The_Degree/Diameter_Problem +
, http://guillermo.com.au/wiki/Research +
|
| http://dbpedia.org/ontology/wikiPageID
|
19726159
|
| http://dbpedia.org/ontology/wikiPageLength
|
19041
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1118907672
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Journal_of_Graph_Theory +
, http://dbpedia.org/resource/Electronic_Journal_of_Combinatorics +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Category:Graphs +
, http://dbpedia.org/resource/Open_problem +
, http://dbpedia.org/resource/Degree_diameter_problem +
, http://dbpedia.org/resource/Discrete_Applied_Mathematics +
, http://dbpedia.org/resource/Cycle_%28graph_theory%29 +
, http://dbpedia.org/resource/European_Journal_of_Combinatorics +
, http://dbpedia.org/resource/Journal_of_Combinatorial_Theory +
, http://dbpedia.org/resource/Petersen_graph +
, http://dbpedia.org/resource/Hoffman%E2%80%93Singleton_graph +
, http://dbpedia.org/resource/IBM_Journal_of_Research_and_Development +
, http://dbpedia.org/resource/McKay%E2%80%93Miller%E2%80%93%C5%A0ir%C3%A1%C5%88_graph +
, http://dbpedia.org/resource/Discrete_Mathematics_%28journal%29 +
, http://dbpedia.org/resource/Australasian_Journal_of_Combinatorics +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Ars_Combinatoria_%28journal%29 +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Diameter_%28graph_theory%29 +
, http://dbpedia.org/resource/Moore_bound +
, http://dbpedia.org/resource/Moore_graph +
, http://dbpedia.org/resource/IEEE_Transactions_on_Computers +
, http://dbpedia.org/resource/Category:Lists_by_size +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Cite_arXiv +
, http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Diagonal_split_header +
, http://dbpedia.org/resource/Template:Cite_web +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Graphs +
, http://dbpedia.org/resource/Category:Lists_by_size +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree?oldid=1118907672&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree +
|
| owl:sameAs |
http://dbpedia.org/resource/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree +
, http://www.wikidata.org/entity/Q7673253 +
, http://rdf.freebase.com/ns/m.0119mj8v +
, https://global.dbpedia.org/id/4w4wQ +
|
| rdfs:comment |
In graph theory, the degree diameter probl … In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem (excluding the case of degree 2, where the largest graphs are cycles with an odd number of vertices).re cycles with an odd number of vertices).
|
| rdfs:label |
Table of the largest known graphs of a given diameter and maximal degree
|
