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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback