Connectivity of consecutive-\(d\) digraphs

DOI10.1016/0166-218X(92)90131-SzbMath0776.05045OpenAlexW2066441664MaRDI QIDQ1199422

G. W. Peck, Ding-Zhu Du, D. Frank Hsu

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90131-s

zbMATH Keywords

generalized De Bruijn digraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields ⋮ Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• Quelques problèmes de connexite dans les graphes orientes
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Hamiltonian property of linear functions
• Connectivity of Regular Directed Graphs with Small Diameters
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Connectivity of Imase and Itoh digraphs
• Design to Minimize Diameter on Building-Block Network

This page was built for publication: Connectivity of consecutive-\(d\) digraphs