Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...
This is a preview. Log in through your library . Abstract For a vertex i of a signed graph, let di, mi and T i - denote its degree, average 2-degree and the number of unbalanced triangles passing ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback