Minimally strong digraphs

DOI10.1017/S0013091500009147MaRDI QIDQ5596093zbMATH OpenFDO

Authors Dennis P. Geller

Publication date 1970

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

Full work available at URL https://doi.org/10.1017/S0013091500009147

zbMATH Keywords

topology

Cites work

• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)

Cited in

(9)

• Structural properties of minimal strong digraphs versus trees
• Walkwise and admissible mappings between digraphs
• scientific article; zbMATH DE number 3817736 (Why is no real title available?)
• Minimal strong digraphs
• On the super-restricted arc-connectivity of s-geodetic digraphs
• A role for doubly stochastic matrices in graph theory
• Graph theory
• Superfluous paths in strong digraphs
• Graphical tests of causality

This page was built for publication: Minimally strong digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5596093)