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) é symmetric graph - definição
Symmetric graph
![automorphism]], since any five-vertex ring can be mapped to any other.](https://commons.wikimedia.org/wiki/Special:FilePath/Petersen1 tiny.svg?width=200 "automorphism]], since any five-vertex ring can be mapped to any other.")
TYPE OF GRAPH WHICH ADMIT AN AUTOMORPHISM ON ADJACENT VERTICES
Arc-transitive graph; Arc-transitive; Foster census; Foster Census; Flag-transitive graph
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism
Elementary symmetric polynomial
HOMOGENEOUS SYMMETRIC POLYNOMIAL IN WHICH EACH POSSIBLE MONOMIAL OCCURS EXACTLY ONCE WITH COEFFICIENT 1
Elementary symmetric function; Elementary symmetric polynomials; Fundamental theorem of symmetric polynomials; Fundamental Theorem of Symmetric Polynomials
In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed as a polynomial in elementary symmetric polynomials. That is, any symmetric polynomial is given by an expression involving only additions and multiplication of constants and elementary symmetric polynomials.
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
