Odeljenje za matematiku, 8. novembar 2024.

Naredni sastanak Seminara biće održan u petak, 8. novembra 2024. godine, u sali 301f Matematičkog instituta SANU sa početkom u 14.15 časova.
 
Predavač: Ivan Damnjanović, Elektronski fakultet, Niš
 
Naslov predavanja: ON THE SPECTRAL RADIUS OF THRESHOLD GRAPHS
 
Apstrakt: The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as v_1, v_2,..., v_n, so that for each 2 ≤ i ≤ n, vertex v_i is either adjacent or nonadjacent to all of v_1, v_2,..., v_{i-1}. Brualdi and Hoffman initially posed and then partially solved the extremal problem of finding the simple graph with a given number of vertices and edges that has the maximum spectral radius. This problem was subsequently completely resolved by Rowlinson. Here, we deal with the similar problem of maximizing the spectral radius over the set of connected simple graphs with a given number of vertices and edges.
As shown by Brualdi and Solheid, each such extremal graph is necessarily a threshold graph. We investigate the spectral radii of threshold graphs by relying on computations involving lazy walks. Furthermore, we obtain certain lower and upper bounds on the spectral radius of a given threshold graph.

(This is a joint work with Peter Csikvari, Dragan Stevanović and Stephan Wagner.)
Napomena:
Predavanje se može pratiti na daljinu preko linka Odeljenja za matematiku: https://miteam.mi.sanu.ac.rs/asset/WbsehnSL4ZeTPJo6r


 Ostavite vaš komentar 

Komentari(0)

Nažalost nije moguće ostaviti komentar.