Sign in
|
English
|
Terms of Use
Dictionary
Forum
Contacts
Russian
⇄
English
G
o
o
g
l
e
|
Forvo
|
+
вершины x и y графа G являются сходными, если существует автоморфизм G, который принимает значения от x до y
stresses
Makarov.
vertices x and y of a graph G are similar if there is an automorphism of G which takes x to y
The server is undergoing maintenance and the site is working in read-only mode. Please check back later.">
Add
|
The server is undergoing maintenance and the site is working in read-only mode. Please check back later.">
Report an error
|
Get short URL
|
Language Selection Tips