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 ...
Adjacency properties of extreme points of a convex polyhedron are discussed. In mathematical programming we are quite often faced with problems of characterizing the ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback