Maximization of the first Laplace eigenvalue of a finite graph II
Given a length function on the set of edges of a finite graph, the corresponding Fujiwara Laplacian is defined. We consider a problem of maximizing the first nonzero eigenvalue of this graph Laplacian over all choices of edge-length function subject to a certain normalization. In this paper we prove that the supremum of the first nonzero eigenvalue is finite if and only if the graph is a tree. We also prove that the supremum of the first nonzero eigenvalue is nonincreasing under taking a subgraph.