In this paper we define connected generalized line digraphs (briefly, GLD) similarly as it has been done for graphs. We say that a digraph G is proper normal (briefly, PND) if its adjacency matrix is ...

We consider the skew Laplacian matrix of a digraph G → obtained by giving an arbitrary direction to the edges of a graph G having n vertices and m edges. We obtain an upper bound for the skew ...