ore's theorem

/AO1 R EH0 S TH IH0 R AH0 M/
noun
  1. 1

    (graph theory) A theorem that considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.

Translate “ore's theorem” into another language

Choose a language below to open the translator with English selected as the source language.

🇪🇸Spanish🇫🇷French🇩🇪German🇸🇦Arabic🇨🇳Chinese Simplified🇯🇵Japanese🇮🇳Hindi🇧🇷Portuguese🇷🇺Russian🇰🇷Korean🇮🇹Italian🇹🇷Turkish
See all 248+ languages
Back to Dictionary