Super line-connectivity of consecutive-\(d\) digraphs

DOI10.1016/S0012-365X(97)00079-4zbMath0895.05035OpenAlexW2029188305MaRDI QIDQ1382814

Feng Cao, Weili Wu, D. Frank Hsu, Ding-Zhu Du, Lihui Hwang

Publication date: 4 May 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00079-4

zbMATH Keywords

consecutive-\(d\) digraphssuper line-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Super link-connectivity of iterated line digraphs. ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ Endo-circulant digraphs: Connectivity and generalized cycles ⋮ Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Kautz networks
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• Large fault-tolerant interconnection networks
• Vosperian and superconnected abelian Cayley digraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• Connectivity of consecutive-\(d\) digraphs
• Super edge-connectivity of dense digraphs and graphs
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Hamiltonian property of linear functions
• Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II
• 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: Super line-connectivity of consecutive-\(d\) digraphs