Finding Hamilton Circuit in a Graph

Ghulam Mustafa Babar,Malik Sikander Hayat Khiyal, Abdul Saeed

CSC（2006）

引用 23|浏览1

暂无评分

摘要

The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial steps. We got some properties; these properties are combined to develop the above mentioned algorithm. These principles and their use will be explained by different examples. More or less these principles are simple and obvious.

查看译文

关键词

active end point,degree of a node,passive end point.,hamilton circuits,virtual single unit

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要