The number of cut vertices and cut arcs in a strong directed graph
From MaRDI portal
Publication:5645443
DOI10.1007/BF01896438zbMath0236.05111MaRDI QIDQ5645443
A. Ramachandra Rao, Siddani Bhaskara Rao
Publication date: 1972
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
05C20: Directed graphs (digraphs), tournaments
Related Items
On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\), Multipartite tournaments: a survey, The number of blocks of a graph with given minimum degree
Cites Work