Graph distinguishing numbers constitute a vital parameter in understanding the symmetry properties of graphs. Fundamentally, the distinguishing number of a graph is the minimal number of labels ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results