Distance-transitive graph
id:
distance-transitive-graph-285-8080641
title:
Distance-transitive graph
text:
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith. A distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorp
brand slug:
wiki
category slug:
encyclopedia
description:
Graph where any two nodes of equal distance are isomorphic
original url:
https://en.wikipedia.org/wiki/Distance-transitive_graph
date created:
date modified:
2024-03-08T11:39:59Z
main entity:
{"identifier":"Q4391306","url":"https://www.wikidata.org/entity/Q4391306"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/32/BiggsSmith.svg","width":639,"height":592}
fields total:
13
integrity:
15