On minimum locally $n$-(arc)-strong digraphs

DOI10.21136/cmj.1996.127293zbMath0870.05028OpenAlexW2724513502MaRDI QIDQ4351243

Zhibo Chen

Publication date: 27 August 1997

Full work available at URL: https://eudml.org/doc/30310

zbMATH Keywords

oriented graphtournamentneighborhood\(n\)-arc-strong digraph\(n\)-strong digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On minimum locally $n$-(arc)-strong digraphs

Cites Work

• Large fault-tolerant interconnection networks
• On the connectivity of Cayley digraphs
• On locally quasiconnected graphs and their upper embeddability
• Every connected, locally connected graph is upper embeddable
• $N_2$-locally connected graphs and their upper embeddability
• Sufficient conditions for locally connected graphs
• On minimum locally $n$-(arc)-strong digraphs
• Locally connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minimum locally $n$-(arc)-strong digraphs