The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges.
Ruud H. TeunterEdo S. Van der PoortPublished in: Oper. Res. Lett. (2000)
Keyphrases
- fixed number
- maximum number
- weighted graph
- undirected graph
- directed edges
- edge weights
- directed graph
- vertex set
- spanning tree
- adjacency matrix
- random graphs
- minimum weight
- graph partitioning
- shortest path
- labeled graphs
- graph model
- densely connected
- hamiltonian cycle
- connected components
- finite number
- attributed graphs
- real world graphs
- average degree
- partial ordering
- graph coloring
- subgraph isomorphism
- graph clustering
- complex networks
- directed acyclic graph
- maximal cliques
- planar graphs
- random walk
- minimum cost
- approximation algorithms
- connected subgraphs
- graph theory
- bipartite graph
- graph mining