Block digraph of a directed graph

Let \(D\) be a connected digraph of order \(n\); \((n \geq 3)\) and let \(B(D)=\{B_1,B_2,\ldots,B_N\}\) be a set of blocks of \(D\). The block digraph \(Q=\mathbb{B}(D)\) has vertex set \(V(Q)=B(D)\) and arc set \(A(Q)=B_iB_j\) and \(B_i,B_j \in V(Q),\) \(B_i,B_j\) have a cut-vertex of \(D\) in comm...

Full description

Bibliographic Details
Main Authors: H. M. Nagesh, M. C. Mahesh Kumar
Format: Article
Language:English
Published: Ptolemy Scientific Research Press 2018-07-01
Series:Open Journal of Mathematical Sciences
Subjects:
Online Access:https://openmathscience.com/block-digraph-of-a-directed-graph/