We have provided a series of Sparse graphs for free download here. Please cite the reference below if you are using the graphs.

Reference

K. K. Lim,  Y. S. Ong, M. H. Lim, X. Chen and A. Agarwal, “Hybrid Ant Colony Algorithm for Path Planning in Sparse Graphs”, Soft Computing Journal, pp. 1432-7643, Nov 2007. Available here as PDF file.

 

 Sparse Hamiltonian graphs

HC01: |V| = 20, |E| = 30, Ed » 0.1579 

HC02: |V| = 20, |E| = 37, Ed » 0.1947

 

 HC03: |V| = 46, |E| = 71, Ed » 0.0686

 

HC04: |V| = 100, |E| = 197, Ed » 0.0398

HC05: |V| = 100, |E| = 203, Ed » 0.0410

 HC06: |V| = 100, |E| = 217, Ed » 0.0438

Sparse Non-Hamiltonian graphs

NHC01: |V| = 46, |E| = 69, Ed »0.0667

 NHC02: |V| = 100, |E| = 197, Ed » 0.0398

NHC03: |V| = 100, |E| = 207, Ed » 0.0418