Digite uma palavra ou frase em qualquer idioma 👆
Idioma:
Tradução e análise de palavras por inteligência artificial ChatGPT
Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
- como a palavra é usada
- frequência de uso
- é usado com mais frequência na fala oral ou escrita
- opções de tradução de palavras
- exemplos de uso (várias frases com tradução)
- etimologia
O que (quem) é Kőnig's theorem (graph theory) - definição
THEOREM SHOWING THAT MAXIMUM MATCHING AND MINIMUM VERTEX COVER ARE EQUIVALENT FOR BIPARTITE GRAPHS
Konig's theorem (graph theory); König theorem (graph theory); Konig theorem (graph theory); Koenig theorem (graph theory); Koenig's theorem (graph theory); Kőnig's theorem; König–Egerváry theorem; Konig-egervary; König-Egerváry theorem; König's theorem (graph theory); Kőnig–Egerváry theorem; Kőnig-Egerváry theorem; König-Egeváry Theorem; Konig property
Kőnig's theorem (graph theory)
In the mathematical area of graph theory, Kőnig's theorem, proved by , describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently, also in 1931, by Jenő Egerváry in the more general case of weighted graphs.
König's theorem (kinetics)
NAMED AFTER SAMUEL KÖNIG
Konig's theorem (kinetics); Koenig's theorem (kinetics); König's decomposition; Konig's decomposition
In kinetics, König's theorem or König's decomposition is a mathematical relation derived by Johann Samuel König that assists with the calculations of angular momentum and kinetic energy of bodies and systems of particles.
Star (graph theory)
NODE-LINK GRAPH IN WHICH ONE CENTRAL NODE IS THE ONLY NEIGHBOR OF ALL THE OTHER NODES
Star graph; Claw (graph theory)
In graph theory, a star Sk is the complete bipartite graph K1,k: a tree with one internal node and k leaves (but no internal nodes and leaves when ). Alternatively, some authors define Sk to be the tree of order k with maximum diameter 2; in which case a star of has leaves.
Wikipédia
Kőnig's theorem (graph theory)
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently, also in 1931, by Jenő Egerváry in the more general case of weighted graphs.
