The Hamiltonian property of linear functions

DOI10.1016/0167-6377(87)90024-1zbMath0615.05033OpenAlexW2064612698MaRDI QIDQ1820790

Frank K. Hwang

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90024-1

zbMATH Keywords

Hamiltonian circuitcirculant digraphnetwork topologyde Bruijn digraphreconfigurable network

Mathematics Subject Classification ID

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

Related Items (7)

Hamiltonian problems in directed graphs with simple row patterns ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ The Hamiltonian property of consecutive-\(d\) digraphs

Cites Work

• The Hamiltonian property of generalized de Bruijn digraphs
• Double loop networks with minimum delay
• Circulants and their connectivities
• A Design for Directed Graphs with Minimum Diameter
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Connectivity of circulant digraphs
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: The Hamiltonian property of linear functions