Matrix transform distinguishing method of Hamilton graphs
Wang Da
Abstract
Wang Da
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).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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