2025/01/07 by João Domingos Gomes da Silva Junior, Junior, João Domingos Gomes da Silva, Carla Silva Oliveira +3
Mathematics · #Graph theory and applications
paper · doi:10.48550/arxiv.2501.03806
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.