Perturbations on bidegreed graphs minimizing the spectral radius |
| |
| Affiliation: | 1. DComp – CCGT – UFSCar – Sorocaba, SP, Brazil;2. Faculty of Computing – FACOM-UFMS – Campo Grande, MS, Brazil;1. Instituto de Matemática e Estatística, Universidade Federal Fluminense, Niterói, RJ, Brazil;2. Instituto de Matemática, Universidade Federal do Rio Grande do Sul, Porto Alegre, RS, Brazil;1. Computer Science Department, Université de Mons, Belgium;2. Department of Mathematics, Université Libre de Bruxelles, Belgium;3. Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Canada;1. Mathematics Department, United States Naval Academy, Annapolis, MD, 21401, USA;2. Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung 80424, Taiwan;1. Banco de México, Calzada Legaria 691, módulo IV, Col. Irrigación, 11500 Ciudad de México, Mexico;2. Escuela Superior de Economía, Plan de Agua Prieta No. 66, Col. Plutarco Elías Calles, 11340 Ciudad de México, Mexico;3. Departamento de Matemáticas, Centro de Investigación y de Estudios Avanzados del IPN, Apartado Postal 14-740, 07000 Ciudad de México, Mexico |
| |
| Abstract: | One common problem in spectral graph theory is to determine which graphs, under some prescribed constraints, maximize or minimize the spectral radius of the adjacency matrix. Here we consider minimizers in the set of bidegreed, or biregular, graphs with pendant vertices and given degree sequence. In this setting, we consider a particular graph perturbation whose effect is to decrease the spectral radius. Hence we restrict the structure of minimizers for k-cyclic degree sequences. |
| |
| Keywords: | bidegreed graphs biregular graphs spectral radius graph index graph perturbation |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
