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

35441

VO_6^-(2)

Steven Van Overberghe

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

Acyclic | No | Index | 27 |

Algebraic Connectivity | 24 | Laplacian Largest Eigenvalue | 32 |

Average Degree | 27 | Longest Induced Cycle | 9 |

Bipartite | No | Longest Induced Path | 7 |

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

Chromatic Number | Computation time out | Maximum Degree | 27 |

Circumference | 64 | Minimum Degree | 27 |

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

Clique Number | 4 | Number of Components | 1 |

Connected | Yes | Number of Edges | 864 |

Density | 0.429 | Number of Triangles | 2880 |

Diameter | 2 | Number of Vertices | 64 |

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

Eulerian | No | Radius | 2 |

Genus | Computation time out | Regular | Yes |

Girth | 3 | Second Largest Eigenvalue | 3 |

Hamiltonian | Yes | Smallest Eigenvalue | -5 |

Independence Number | 6 | 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 Steven Van Overberghe at May 30, 2020 6:52 PM.

Extremal graph containing no K5-e as a subgraph, nor a K7-e in the complement, establishing R(K5-e,K7-e)=65.

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