2010•Journal of Qiqihar UniversityRequires access

Matrix transform distinguishing method of Hamilton graphs

Wang Da

Open publisher page 0 citations

Abstract

In this paper,plans to use relationship of the adjacent matrix of graphs and permutation similar of special matrices,to differentiate existence of Hamilton cycle(path).Analysis undirected graph and directed graph,get necessary and sufficient condition o f Hamilton cycle(path).

About this research paper

What this paper is about

In this paper,plans to use relationship of the adjacent matrix of graphs and permutation similar of special matrices,to differentiate existence of Hamilton cycle(path).Analysis undirected graph and directed graph,get necessary and sufficient condition o f Hamilton cycle(path).

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper,plans to use relationship of the adjacent matrix of graphs and permutation similar of special matrices,to differentiate existence of Hamilton cycle(path).Analysis undirected graph and directed graph,get necessary and sufficient condition o f Hamilton cycle(path).

Key concepts: Hamiltonian path, Mathematics, Combinatorics, Permutation matrix, Path (computing), Matrix (chemical analysis), Undirected graph, Directed graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Matrix transform distinguishing method of Hamilton graphs — Research Paper | ScholarLens