Minimally strong digraphs

DOI10.1017/S0013091500009147zbMath0197.50503MaRDI QIDQ5596093

Dennis P. Geller

Publication date: 1970

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (8)

Superfluous paths in strong digraphs ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Structural properties of minimal strong digraphs versus trees ⋮ Minimal strong digraphs ⋮ A role for doubly stochastic matrices in graph theory ⋮ Unnamed Item ⋮ Graph theory ⋮ Walkwise and admissible mappings between digraphs

Cites Work

• Unnamed Item
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Minimally strong digraphs