uniform graphs
[/ˈjuːnɪfɔːrm ɡræfs/]
nounpl: uniform graphs
grafos uniformes
1. In graph theory, graphs in which all vertices have the same degree (the same number of edges connected to each vertex)
A complete graph is an example of a uniform graph where every vertex connects to every other vertex.
Um grafo completo é um exemplo de um grafo uniforme onde cada vértice se conecta a todos os outros vértices.
2. Graphs that exhibit uniform structural properties or symmetries across all vertices or edges
Uniform graphs are often studied in network analysis due to their symmetric properties.
Grafos uniformes são frequentemente estudados em análise de redes devido às suas propriedades simétricas.
3. Regular graphs where the degree of regularity is consistent throughout the entire graph structure
The Petersen graph is a well-known uniform graph in combinatorics.
O grafo de Petersen é um grafo uniforme bem conhecido em combinatória.
This is specialized mathematical and computer science terminology used primarily in academic and research contexts in both Brazil and Portugal. The term is consistent across both Portuguese-speaking countries and follows international mathematical conventions. It is commonly encountered in university courses on graph theory, discrete mathematics, and network analysis.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →