Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03398752n
Noun Concept
Categories: Regular graphs, Graph families, Algebraic graph theory
EN
vertex-transitive graph  Vertex transitive graph
EN
In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism f : G → G {\displaystyle f:G\to G\ } such that f = v 2. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism f : G → G {\displaystyle f:G\to G\ } such that f = v 2. Wikipedia
A graph whose automorphism group acts transitively upon its vertices Wikipedia Disambiguation
IS A
graph
HAS KIND
symmetric graph
half-transitive graph
rook's graph
Möbius ladder
distance-transitive graph
+5 relations
HAS INSTANCE
Hall–Janko graph
Wagner graph
Franklin graph
Clebsch graph
Holt graph
+22 relations
STUDIED BY
graph theory
Wikipedia
EN
vertex-transitive graph
Wikidata
EN
vertex-transitive graph
Wikipedia Redirections
EN
Vertex transitive graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License