$\cong\text{ Incidence graph of Hadamard }(7,3,1)\text{-design}$

Number of vertices: | $14$ |

Diameter: | $3$ |

Intersection array: | $\{3,2,2; 1,1,3\}$ |

Spectrum: | $3^1 (\sqrt{2})^6 (-\sqrt{2})^6 (-3)^1$ |

Automorphism group: | $PGL(2,7)$ |

Distance-transitive: | $\text{Yes}$ |

Bipartite |

- $\text{Adjacency matrix}$
- $\text{Adjacency matrix in GAP format}$
- $\text{Adjacency matrix in CSV format}$
- $\text{Graph in GRAPE format}$