Applications of rational difference equations to spectral graph theory

DOI10.1080/10236198.2021.1962315zbMath1477.05109arXiv2009.01648OpenAlexW3192090612MaRDI QIDQ5163949

Vilmar Trevisan, Elismar R. Oliveira

Publication date: 9 November 2021

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.01648

zbMATH Keywords

periodic solutionsrecurrence relationeigenvalues of graphseigenvalue location

Mathematics Subject Classification ID

Trees (05C05) Recurrences (11B37) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Infinite graphs (05C63) Periodic solutions of difference equations (39A23) Numerical aspects of recurrence relations (65Q30)

Related Items (2)

On Quipus whose signless Laplacian index does not exceed 4.5 ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Locating the eigenvalues of trees
• On limit points of Laplacian spectral radii of graphs
• Asymptotic results on the spectral radius and the diameter of graphs
• On the distribution of the maximum eigenvalues of graphs
• Most Laplacian eigenvalues of a tree are small
• Spectral ordering of trees with small index
• Laplacian energy of diameter 3 trees
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• Spectral radius ordering of starlike trees

This page was built for publication: Applications of rational difference equations to spectral graph theory