On the Szeged and the Laplacian Szeged spectrum of a graph (CROSBI ID 175875)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Fath-Tabar, Gholam-Hossein ; Došlić, Tomislav ; Ashrafi, Ali Reza
engleski
On the Szeged and the Laplacian Szeged spectrum of a graph
For a given graph $G$ its Szeged weighting is defined by $w(e) = n_u(e)n_v(e)$, where $e=uv$ is an edge of $G$, $n_u(e)$ is the number of vertices of $G$ closer to $u$ than to $v$, and $n_v(e)$ is defined analogously. The adjacency matrix of a graph weighted in this way is called its Szeged matrix. In this paper we determine the spectra of of Szeged matrices and their Laplacians for several families of graphs. We also present sharp upper and lower bounds on the eigenvalues of Szeged matrices of graphs.
Szeged matrix; Laplacian matrix; Laplacian Szeged matrix; Szeged eigenvalue; Laplacian Szeged eigenvalue; Szeged index
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
433 (3)
2010.
662-671
objavljeno
0024-3795
10.1016/j.laa.2010.03.039