This is a preview. Log in through your library . Abstract A signed graph consists of a (simple) graph G = (V, E) together with a function σ : E {+; −} called signature. Matrices can be associated to ...
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