2024/10/22 by Rao Li, Li, Rao
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #Spectral Theory in Mathematical Physics
paper · pdf · doi:10.48550/arxiv.2410.17380
openalex publication_date 2024/10/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G = (V, E) be a graph. We define matrices M(G; α, β)as αD + βA, where α, β are real numbers such that (α, β) ≠ (0, 0) and D and A are the diagonal matrix and adjacency matrix of G, respectively. Using the largest and smallest eigenvalues of M(G; α, β) with α≥ β> 0, we present sufficient conditions for the Hamiltonian and traceable graphs.