CONSTRUCTING THE HAMILTON CYCLE ON γ-ARY DE BRUIJN-GOOD GRAPH——THE γ-ARY DE BRUIJN SEQUENCE
杨君辉
Abstract
杨君辉
Abstract
In the paper we use a nonsingular function as an elementary recurring function togenerate a portion graph G(f)on r-ary de Bruijn-good graph,define order function on G(f),construct associated state matrix sets,merge cycles by interchanging successors of associated statesto form a full length cycle-the Hamilton cycle on r-ary de Bruijn-good graph(the r-ary d(?)Bruijn sequence).
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 the paper we use a nonsingular function as an elementary recurring function togenerate a portion graph G(f)on r-ary de Bruijn-good graph,define order function on G(f),construct associated state matrix sets,merge cycles by interchanging successors of associated statesto form a full length cycle-the Hamilton cycle on r-ary de Bruijn-good graph(the r-ary d(?)Bruijn sequence).
Key concepts: De Bruijn sequence, De Bruijn graph, Combinatorics, Hamiltonian path, Mathematics, Graph, Merge (version control), Discrete mathematics