The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs
Yi Dai

TL;DR
This paper investigates the smallest normalized signless infinity-Laplacian eigenvalue for non-bipartite connected graphs, establishing a relationship with the minimal infinity-norm of generalized inverses of the weighted signless incidence matrix.
Contribution
It introduces a novel characterization of the smallest eigenvalue as the reciprocal of the minimal infinity-norm of certain generalized inverses, extending spectral graph theory.
Findings
Established the equality of the eigenvalue with the reciprocal norm
Provided an illustrative example demonstrating the theoretical result
Extended understanding of signless Laplacian eigenvalues in non-bipartite graphs
Abstract
In this paper, we aim to study the smallest normalized signless -Laplacian eigenvalue , a generalisation of the smallest signless Laplacian eigenvalue. For a non-bipartite connected graph, we show that the invariant equals to the reciprocal of the minimal -norm of the generalized inverses of the weighted signless incidence matrix. An example is also given to illustrate the result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · Metal-Organic Frameworks: Synthesis and Applications
