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

33628

Transposition Graph N=5

Kevin Ryde

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

Acyclic | No | Index | undefined |

Algebraic Connectivity | 5 | Laplacian Largest Eigenvalue | 20 |

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

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

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

Chromatic Number | 2 | Maximum Degree | 10 |

Circumference | Computation time out | Minimum Degree | 10 |

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

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 600 |

Density | 0.084 | Number of Triangles | 0 |

Diameter | 4 | Number of Vertices | 120 |

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

Eulerian | Yes | Radius | 4 |

Genus | Computation time out | Regular | Yes |

Girth | 4 | Second Largest Eigenvalue | undefined |

Hamiltonian | Computation time out | Smallest Eigenvalue | undefined |

Independence Number | 60 | 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 Kevin Ryde at Feb 23, 2019 2:33 AM.

Each vertex is a permutation of N=5 elements. There are 5!=120 such. Each edge is by swapping two elements to reach a new permutation.

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