The Hamiltonian property of the consecutive-3 digraphs

DOI10.1016/S0895-7177(97)00086-1zbMath0890.05030MaRDI QIDQ1368420

Li-Da Tong, Frank K. Hwang, Gerard Jennhwa Chang

Publication date: 25 June 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

Hamiltonianconsecutive-\(d\) digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonicity of large generalized de Bruijn cycles ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS

Cites Work

• The Hamiltonian property of generalized de Bruijn digraphs
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Hamiltonian property of linear functions
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of circulant digraphs
• Random Number Generators
• Design to Minimize Diameter on Building-Block Network
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Unnamed Item
• Unnamed Item

This page was built for publication: The Hamiltonian property of the consecutive-3 digraphs