4 views

1 Answers

In the mathematical field of graph theory, the Livingstone graph is a distance-transitive graph with 266 vertices and 1463 edges. Its intersection array is {11,10,6,1;1,1,5,11}. It is the largest distance-transitive graph with degree 11.

4 views

Related Questions

What is Archimedean graph?
1 Answers 5 Views
What is Heawood graph?
1 Answers 6 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Diamond graph?
1 Answers 5 Views
What is Biconnected graph?
1 Answers 4 Views
What is Ladder graph?
1 Answers 4 Views
What is Half-transitive graph?
1 Answers 4 Views
What is Edge-transitive graph?
1 Answers 4 Views
What is Butterfly graph?
1 Answers 4 Views