Block digraph of a directed graph
H. M. Nagesh, M. C. Mahesh Kumar · Open Journal of Mathematical Sciences · 2018
Let D be a connected digraph of order n (n ≥ 3) and letcommon and every vertex of B j is reachable from every other vertex of B i .We study the properties of B(D) and present the characterization of digraphs whose B(D) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; Eulerian; and Hamiltonian.