New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory

DOI10.1080/09720529.2016.1226618zbMath1495.05164OpenAlexW2750821361MaRDI QIDQ5069927

Qing-Bi He, Mao Ming Jin, Huiming Duan, Qing-Hua Zhang, Hong-Gang Li

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2016.1226618

zbMATH Keywords

Boolean determinantcharacteristic determinant of a directed graphHamiltonian-cycles decision algorithmnew Hamiltonian-cycles decision theorems in directed graphsproperties of Boolean determinants

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Research on the matching algorithm for heterologous image after deformation in the same scene

Cites Work

• Transformations on tensor product spaces
• The determinants of certain matrices arising from the Boolean lattice
• Primes in the semigroup of Boolean matrices
• Linear transformations which preserve fixed rank
• Determinantal identities over commutative semirings
• The finite free extension of Artinian \(K\)-algebras with the strong Lefschetz property
• On ConnectedmMultiply 2 dimensions Composite Hyperplane Complete Graph's Residual Graphs
• On ranks, Green classes, and the theory of determinants of Boolean matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory