complete graph
[/kəmˈplit ɡræf/]
nounpl: complete graphs
grafo completo
1. A graph in which every pair of distinct vertices is connected by a unique edge, with no loops or multiple edges between the same pair of vertices.
In a complete graph with 5 vertices, every vertex is directly connected to every other vertex, resulting in 10 edges total.
Em um grafo completo com 5 vértices, cada vértice está diretamente conectado a todos os outros vértices, resultando em 10 arestas no total.
2. Denoted by Kₙ where n is the number of vertices; commonly used in graph theory and discrete mathematics.
The complete graph K₄ represents a scenario where 4 people all know each other.
O grafo completo K₄ representa um cenário onde 4 pessoas se conhecem mutuamente.
This is a technical term primarily used in academic and professional settings within computer science, discrete mathematics, and network analysis. It is equally understood across Brazil, Portugal, and English-speaking countries in educational and research contexts. The term has no colloquial variations and maintains consistent usage across regions.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →