The Hamiltonian property of the consecutive-3 digraphs

DOI10.1016/S0895-7177(97)00086-1MaRDI QIDQ1368420zbMATH OpenFDO

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

Publication date 25 June 1998

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

Full work available at URL https://doi.org/10.1016/S0895-7177(97)00086-1

zbMATH Keywords

consecutive-\(d\) digraphHamiltonian

Mathematics Subject Classification ID

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

Review text

A consecutive-\(d\) digraph is a digraph \(G(d,n,q,r)\) whose \(n\) vertices are labelled by the residues modulo \(n\) and a link from vertex \(i\) to vertex \(j\) exists iff \(j\equiv qi+k\pmod n\) for some \(k\) with \(r\leq k\leq r+d- 1\). \textit{D.-Z. Du}, \textit{D. F. Hsu} and \textit{F. K. Hwang} [Math. Comput. Modelling 17, No. 11, 61-63 (1993; Zbl 0789.05040)] conjectured that consecutive-3 digraphs are Hamiltonian. Here the authors show that there exist infinite classes of consecutive-3 digraphs which are not Hamiltonian and others which are Hamiltonian.

Recommendations

• The Hamiltonian property of consecutive-\(d\) digraphs
• scientific article; zbMATH DE number 4204369
• The Hamiltonian numbers in digraphs
• On hamiltonicity of circulant digraphs of outdegree three
• Hamiltonian property of 3-connected \([5,3]\)-graphs
• Hamiltonian degree sequences in digraphs
• Hamiltonicity of 3-connected L₁-graphs
• Hamiltonicity of 3-connected line graphs
• scientific article; zbMATH DE number 3926956
• On the Hamiltonian property hierarchy of 3-connected planar graphs

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of circulant digraphs
• Design to Minimize Diameter on Building-Block Network
• scientific article; zbMATH DE number 4204369 (Why is no real title available?)
• scientific article; zbMATH DE number 857070 (Why is no real title available?)
• Random Number Generators
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• The Hamiltonian property of linear functions

Cited in

(10)

• On hamiltonicity of circulant digraphs of outdegree three
• The Hamiltonian property of generalized de Bruijn digraphs
• The Hamiltonian property of consecutive-\(d\) digraphs
• On connectivity of consecutive-d digraphs
• Hamiltonicity of large generalized de Bruijn cycles
• scientific article; zbMATH DE number 4204369 (Why is no real title available?)
• scientific article; zbMATH DE number 1286212 (Why is no real title available?)
• scientific article; zbMATH DE number 1555253 (Why is no real title available?)
• Eulerian and Hamiltonian dicycles in directed hypergraphs
• Hamilton cycles in digraphs of unitary matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368420)