2026-04-17T05:35:26Zhttps://recercat.cat/oai/requestoai:recercat.cat:2117/131612025-07-17T01:03:37Zcom_2072_1033col_2072_452950
RECERCAT
author
Dalfó Simó, Cristina
author
Fiol Mora, Miquel Àngel
author
Garriga Valle, Ernest
2011-09-02
This paper presents bounds for the variation of the spectral radius (G) of
a graph G after some perturbations or local vertex/edge modifications of G. The
perturbations considered here are the connection of a new vertex with, say, g vertices
of G, the addition of a pendant edge (the previous case with g = 1) and the addition
of an edge. The method proposed here is based on continuous perturbations and
the study of their differential inequalities associated. Within rather economical
information (namely, the degrees of the vertices involved in the perturbation), the
best possible inequalities are obtained. In addition, the cases when equalities are
attained are characterized. The asymptotic behavior of the bounds obtained is
also discussed.Postprint (published version)
Open Access
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
Graph algorithms
Adjacency matrix
Spectral radius
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
A differential approach for bounding the index of graphs under perturbations
Article