Preferred language:

This is the default search language used by BabelNet
Select the main languages you wish to use in BabelNet:
Selected languages will be available in the dropdown menus and in BabelNet entries
Select all

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

all preferred languages
    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

 No term available

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

 No term available

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17     •     Categories: Algebraic graph theory, Graph families, Regular graphs

  Vertex-transitive graph · Vertex transitive graph

In t태평양mathemati태평양 field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17     •     Categories: Famille de graphes

  Graphe sommet-transitif

En théorie des graphes, un graphe non-orienté est sommet-transitif si pour tout couple de sommets, il existe un automorphisme de graphe qui envoie le premier sommet sur le deuxième. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  eckentransitiv graphen From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  κορυφή-μεταβατική γράφημα From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  גרף קודקוד-יוצא From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  ग्राफ शिखर सकर्मक From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  vertice-transitivo grafico From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17     •     Categories: 数学に関する記事, グラフ理論

  頂点推移グラフ · 頂点推移的グラフ

数学のグラフ理論の分野における頂点推移グラフ(ちょうてんすいいグラフ、英: vertex-transitive graph)とは、与えられた任意の二頂点 v1 および v2 に対して f = v 2 {\displaystyle f=v_{2}\ } であるような自己同型 f : V → V {\displaystyle f:V\rightarrow V\ } が存在するグラフ G のことを言う。 Wikipedia

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17     •     Categories: Алгебраическая теория графов, Регулярные графы, Семейства графов, Теория графов

  Вершинно-транзитивный граф

В теории графов вершинно-транзитивным графом называется граф G такой, что для любых двух вершин v1 и v2 графа G существует автоморфизм f : V → V {\displaystyle f:V\rightarrow V\ } такой, что f = v 2. Wikipedia

More definitions


Граф G такой, что для любых двух вершин v1 и v2 графа G существует автоморфизм Wikidata

    •     bn:03398752n     •     NOUN     •     Concept    •     Updated on 2019/10/17

  gráfico vértice-transitivo From automatic translation

 In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism f : V → V {\displaystyle f\colon V\rightarrow V\ } such that f = v 2 . {\displaystyle f=v_{2}. Wikipedia


 

Translations

vertex-transitive graph, vertex transitive graph
graphe sommet-transitif
eckentransitiv graphen
κορυφή-μεταβατική γράφημα
גרף קודקוד-יוצא
ग्राफ शिखर सकर्मक
vertice-transitivo grafico
頂点推移グラフ, 頂点推移的グラフ
вершинно-транзитивный граф
gráfico vértice-transitivo

Sources

Translations from Wikipedia sentences

graphe sommet-transitif
eckentransitiv graphen
κορυφή-μεταβατική γράφημα
גרף קודקוד-יוצא
ग्राफ शिखर सकर्मक
vertice-transitivo grafico
gráfico vértice-transitivo
3 sources | 3 senses
3 sources | 3 senses
1 source | 1 sense
1 source | 1 sense
1 source | 1 sense
1 source | 1 sense
1 source | 1 sense
3 sources | 3 senses
2 sources | 2 senses
1 source | 1 sense

Compounds

BabelNet

Other forms

BabelNet

vertex transitive, vertex-transitive
頂点推移的
вершинно-транзитивны, вершинно-транзитивным

External Links