The smallest normalized signless ∞-Laplacian eigenvalue for non-bipartite connected 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.