Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.03806 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917462391390208 |
|---|---|
| author | Junior, João Domingos Gomes da Silva Oliveira, Carla Silva da Costa, Liliana Manuela Gaspar Cerveira |
| author_facet | Junior, João Domingos Gomes da Silva Oliveira, Carla Silva da Costa, Liliana Manuela Gaspar Cerveira |
| contents | In 2017, Nikiforov introduced the concept of the $A_α$-matrix, as a linear convex combination of the adjacency matrix and the degree diagonal matrix of a graph. This matrix has attracted increasing attention in recent years, as it serves as a unifying structure that combines the adjacency matrix and the signless Laplacian matrix. In this paper, we present some bounds for the largest and smallest eigenvalue of $A_α$-matrix involving invariants associated to graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_03806 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounds on $A_α$-eigenvalues using graph invariants Junior, João Domingos Gomes da Silva Oliveira, Carla Silva da Costa, Liliana Manuela Gaspar Cerveira Combinatorics 0505C In 2017, Nikiforov introduced the concept of the $A_α$-matrix, as a linear convex combination of the adjacency matrix and the degree diagonal matrix of a graph. This matrix has attracted increasing attention in recent years, as it serves as a unifying structure that combines the adjacency matrix and the signless Laplacian matrix. In this paper, we present some bounds for the largest and smallest eigenvalue of $A_α$-matrix involving invariants associated to graphs. |
| title | Bounds on $A_α$-eigenvalues using graph invariants |
| topic | Combinatorics 0505C |
| url | https://arxiv.org/abs/2501.03806 |