arXiv:2412.02179 [math.CO]AbstractReferencesReviewsResources
Maximization of the first Laplace eigenvalue of a finite graph II
Published 2024-12-03Version 1
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 infinite whenever the graph contains a cycle.
Comments: 12 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2210.10966 [math.CO] (Published 2022-10-20)
Maximization of the first Laplace eigenvalue of a finite graph
arXiv:2002.03584 [math.CO] (Published 2020-02-10)
Optimal embedding and spectral gap of a finite graph
The monodromy pairing and discrete logarithm on the Jacobian of finite graphs