Vertex-transitive graph
id:
vertex-transitive-graph-172-17762506
title:
Vertex-transitive graph
text:
In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges. A graph is a vertex-transitive graph if, given any two vertices v1 and v2 of G, there is an automorphism f such that
- f = v 2. In other words, a graph is vertex-transitive if its automorphism group acts transitively on its vertices. A graph is vertex-transitive if and only if its graph complement is, since the group actions ar
brand slug:
wiki
category slug:
encyclopedia
description:
Graph where all pairs of vertices are automorphic
original url:
https://en.wikipedia.org/wiki/Vertex-transitive_graph
date created:
2004-04-07T01:53:40Z
date modified:
2024-09-02T05:38:37Z
main entity:
{"identifier":"Q220997","url":"https://www.wikidata.org/entity/Q220997"}
image:
fields total:
13
integrity:
15