“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 11472
School of Mathematics
  Title:   On the Szeged and the Laplacian szeged spectrum of a graph
  Author(s):  A. R. Ashrafi (Joint with Gh. H. Fath-Tabar and T. Doslic)
  Status:   Published
  Journal: Linear Algebra Appl.
  Vol.:  433
  Year:  2010
  Pages:   662-671
  Supported by:  IPM
For a given graph G its Szeged weighting is defined by w(e)=nu(e)nv(e), where e=uv is an edge of G,nu(e) is the number of vertices of G closer to u than to v, and nv(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 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.

Download TeX format
back to top
scroll left or right