On the largest strong components in \(m\)-out digraphs

DOI10.1016/0012-365X(91)90305-LzbMath0751.05080OpenAlexW2085126890MaRDI QIDQ1182737

W. C. Stephen Suen

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90305-l

zbMATH Keywords

\(m\)-out digraphlargest strongly connected subgraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

On depth first search trees in \(m\)-out digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On depth first search trees in \(m\)-out digraphs
• On the connectivity of random m-orientable graphs and digraphs
• Finding Hamilton cycles in sparse random graphs
• Parallel concepts in graph theory
• On the existence of Hamiltonian cycles in a class of random graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On the largest strong components in \(m\)-out digraphs