Univerza na Primorskem
Fakulteta za matematiko, naravoslovje in informacijske tehnologije
2025-05-08
18:00
Online via Zoom (See link below)
Ivan Damnjanović (FAMNIT, University of Primorska, Koper, Slovenia, and Faculty of Electronic Engineering, University of Niš, Niš, Serbia)
On the maximum spectral radius of connected graphs with a prescribed order and size
The spectral radius, or index, of a graph is the largest eigenvalue of its (0,1)-adjacency matrix. Let Cn,e be the set comprising all the connected simple graphs of order n and size n − 1 + e. We investigate the spectral radius maximization problem on Cn,e and provide the solution for the case when e ∈ {0, 1, 2, …, 130} or n ≥ e + 2 + 13√e.
Join Zoom Meeting HERE!