Necessary and sufficient conditions for hamiltonian based on linear diophantine equation systems with cycle vector

  • Guohun Zhu*
  • , Chunwei Song
  • , Kaoru Hirota
  • , Fangyan Dong
  • , Yonghua Wu
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

Two necessary and sufficient conditions are presented for Hamiltonian cycle problem in simple undirected graph using linear Diophantine equation systems with cycle vector. The first one is based on the incidence matrix and the second one is based on edge-adjacency matrix. It is proven that the solution set of the cycle vector correspond to the edges of Hamiltonian cycle in a given graph. Based on these result conditions, two necessary conditions for the Hamiltonian graph are given by determining the rank of the matrix.

Original languageEnglish
Title of host publication3rd International Conference on Genetic and Evolutionary Computing, WGEC 2009
Pages847-850
Number of pages4
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event3rd International Conference on Genetic and Evolutionary Computing, WGEC 2009 - Guilin, China
Duration: 14 Oct 200917 Oct 2009

Publication series

Name3rd International Conference on Genetic and Evolutionary Computing, WGEC 2009

Conference

Conference3rd International Conference on Genetic and Evolutionary Computing, WGEC 2009
Country/TerritoryChina
CityGuilin
Period14/10/0917/10/09

Keywords

  • Cycle vector
  • Edge adjacency matrix
  • Hamiltonian cycle
  • Incidence matrix
  • Linear diophantine equation system
  • Rank

Fingerprint

Dive into the research topics of 'Necessary and sufficient conditions for hamiltonian based on linear diophantine equation systems with cycle vector'. Together they form a unique fingerprint.

Cite this