A theorem that considers the sum of the degrees of pairs of non-adjacentvertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.
Origin
Proved in 1960 by Norwegian mathematician Øystein Ore.
Modern English dictionary
Explore and search massive catalog of over 900,000 word meanings.
Word of the Day
Get a curated memorable word every day.
Challenge yourself
Level up your vocabulary by setting personal goals.