## Adjacency matrix[Too large to display] |
## Adjacency list[Too large to display] |

44039

n/a

House of Graphs

Invariant | Value | Invariant | Value |
---|---|---|---|

Acyclic | No | Index | 3 |

Algebraic Connectivity | 0.021 | Laplacian Largest Eigenvalue | 6 |

Average Degree | 3 | Longest Induced Cycle | Computation time out |

Bipartite | Yes | Longest Induced Path | Computation time out |

Chromatic Index | Computation time out | Matching Number | 125 |

Chromatic Number | 2 | Maximum Degree | 3 |

Circumference | Computation time out | Minimum Degree | 3 |

Claw-Free | No | Minimum Dominating Set | Computation time out |

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 375 |

Density | 0.012 | Number of Triangles | 0 |

Diameter | 25 | Number of Vertices | 250 |

Edge Connectivity | Computation time out | Planar | Computation time out |

Eulerian | No | Radius | 25 |

Genus | Computation time out | Regular | Yes |

Girth | 6 | Second Largest Eigenvalue | 2.979 |

Hamiltonian | Computation time out | Smallest Eigenvalue | -3 |

Independence Number | Computation time out | Vertex Connectivity | Computation time out |

A table row rendered like this
indicates that the graph is marked as being *interesting* for that invariant.

Posted by House of Graphs at Sep 21, 2020 4:03 PM.

Is a vertex-transitive cubic graph. See: P. Potočnik, P. Spiga, G. Verret, Cubic vertex-transitive graphs on up to 1280 vertices, Journal of Symbolic Computation 50 (2013), 465-477.

You need to be logged in to be able to add comments.