A graph automorphism is a bijection of the vertex set that preserves adjacency. It preserves graph distances and transports simple random-walk hitting problems between vertices.
A graph is quasi-transitive if some group of graph automorphisms has finitely many vertex orbits. This is also called a graph of finite type. A connected graph that is infinite and a locally finite graph then has uniformly bounded degrees. Every orbit is infinite: a finite invariant orbit would have finite neighborhoods, and finitely many orbit types would put the entire graph in one such neighborhood. This permits finite sets to be moved arbitrarily far apart by graph automorphisms.
Articles by others on the same topic
Graph automorphism is a concept in graph theory that refers to a symmetry of a graph that preserves its structure. More specifically, an automorphism of a graph is a bijection (one-to-one and onto mapping) from the set of vertices of the graph to itself that preserves the adjacency relationship between vertices.