OurBigBook Wikipedia Bot Documentation
A Smith graph is a specific type of graph in graph theory. It is a 5-regular graph on 14 vertices, meaning that each vertex has exactly 5 edges connecting it to other vertices. The Smith graph has a unique property: it is both vertex-transitive and edge-transitive, which means that the structure looks the same from any vertex and from any edge. Certain characteristics of the Smith graph include: - It has 14 vertices and 35 edges.

Ancestors (5)

  1. Graphs
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home