The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916545412726784 |
|---|---|
| author | Dai, Yi |
| author_facet | Dai, Yi |
| contents | In this paper, we aim to study the smallest normalized signless $\infty$-Laplacian eigenvalue $μ_{\infty}$, a generalisation of the smallest signless Laplacian eigenvalue. For a non-bipartite connected graph, we show that the invariant $μ_{\infty}$ equals to the reciprocal of the minimal $\infty$-norm of the generalized inverses of the weighted signless incidence matrix. An example is also given to illustrate the result. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_20513 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs Dai, Yi Combinatorics In this paper, we aim to study the smallest normalized signless $\infty$-Laplacian eigenvalue $μ_{\infty}$, a generalisation of the smallest signless Laplacian eigenvalue. For a non-bipartite connected graph, we show that the invariant $μ_{\infty}$ equals to the reciprocal of the minimal $\infty$-norm of the generalized inverses of the weighted signless incidence matrix. An example is also given to illustrate the result. |
| title | The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.20513 |