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

45590

n/a

House of Graphs

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

Acyclic | No | Index | 3 |

Algebraic Connectivity | 0.2 | Laplacian Largest Eigenvalue | 6 |

Average Degree | 3 | Longest Induced Cycle | 16 |

Bipartite | Yes | Longest Induced Path | 16 |

Chromatic Index | 3 | Matching Number | 13 |

Chromatic Number | 2 | Maximum Degree | 3 |

Circumference | 26 | Minimum Degree | 3 |

Claw-Free | No | Minimum Dominating Set | 7 |

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 39 |

Density | 0.12 | Number of Triangles | 0 |

Diameter | 7 | Number of Vertices | 26 |

Edge Connectivity | 3 | Planar | No |

Eulerian | No | Radius | 5 |

Genus | 2 | Regular | Yes |

Girth | 4 | Second Largest Eigenvalue | 2.8 |

Hamiltonian | Yes | Smallest Eigenvalue | -3 |

Independence Number | 13 | Vertex Connectivity | 3 |

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

Posted by House of Graphs at Mar 30, 2021 9:08 PM.

A cubic graph with the maximum number of edge-Kempe equivalence classes for the given order. See: "J. Goedgebeur and P.R.J. Ostergard, Switching 3-edge-colorings of cubic graphs, manuscript, 2021" for more details.

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