The Number of Strong Digraphs

DOI10.1112/blms/3.3.348zbMath0224.05109OpenAlexW2014469944MaRDI QIDQ5629651

E. M. Wright

Publication date: 1971

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/3.3.348

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Minimal strong digraphs ⋮ The birth of the strong components ⋮ Exact enumeration of satisfiable 2-SAT formulae ⋮ Counting acyclic and strong digraphs by descents

This page was built for publication: The Number of Strong Digraphs