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...
4 KB (474 words) - 07:32, 6 March 2024
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...
16 KB (1,130 words) - 21:01, 8 March 2024
of vertices in any graph with this degree and diameter. Therefore, these graphs solve the degree diameter problem for their parameters. Another equivalent...
12 KB (1,531 words) - 11:08, 3 November 2023
graphs Conway's 99-graph problem: does there exist a strongly regular graph with parameters (99,14,1,2)? Degree diameter problem: given two positive integers...
189 KB (19,472 words) - 06:33, 15 July 2024
Distance (graph theory) (redirect from Diameter (graph theory))
Resistance distance Betweenness centrality Centrality Closeness Degree diameter problem for graphs and digraphs Metric graph Bouttier, Jérémie; Di Francesco...
7 KB (927 words) - 23:37, 6 January 2024
Table of vertex-symmetric digraphs (section Table of the orders of the largest known vertex-symmetric graphs for the directed degree diameter problem)
vertex transitive digraphs (as of October 2008) in the directed Degree diameter problem are tabulated below. Kautz, W.H. (1969), "Design of optimal interconnection...
10 KB (187 words) - 21:16, 8 February 2023
traveller problem Cliques and independent sets Clique problem Connected component Cycle space de Bruijn sequences Degree diameter problem Entanglement...
7 KB (664 words) - 12:10, 30 October 2023
Retrieved 2019-11-11. {{cite book}}: |website= ignored (help) The (Degree, Diameter) Problem for Graphs, Maite71.upc.es, archived from the original on 2012-02-17...
35 KB (4,123 words) - 04:47, 9 May 2024
MaxDDBS (category Computational problems in graph theory)
Maximum Degree-and-Diameter-Bounded Subgraph problem (MaxDDBS) is a problem in graph theory. Given a connected host graph G, an upper bound for the degree d...
2 KB (222 words) - 00:21, 22 April 2024
shortest path between any two vertices. The Moore bound in the degree diameter problem implies that at least one of these two kinds of guardable sets...
8 KB (1,156 words) - 15:01, 17 October 2023