The smallest normalized signless -Laplacian eigenvalue for non-bipartite connected graphs
arXiv:2412.20513
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.