Table Of The Largest Known Graphs Of A Given Diameter And Maximal Degree
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).
Read more about Table Of The Largest Known Graphs Of A Given Diameter And Maximal Degree: Table of The Orders of The Largest Known Graphs For The Undirected Degree Diameter Problem
Famous quotes containing the words table, largest and/or degree:
“They were not on the table with their elbows.
They were not sleeping in the shelves of bunks.
I saw no men there and no bones of men there.”
—Robert Frost (1874–1963)
“We saw many straggling white pines, commonly unsound trees, which had therefore been skipped by the choppers; these were the largest trees we saw; and we occasionally passed a small wood in which this was the prevailing tree; but I did not notice nearly so many of these trees as I can see in a single walk in Concord.”
—Henry David Thoreau (1817–1862)
“[F]or as Socrates says that a wise man is a citizen of the world, so I thought that a wise woman was equally at liberty to range through every station or degree of men, to fix her choice wherever she pleased.”
—Sarah Fielding (1710–1768)