On the Szeged and the Laplacian Szeged spectrum of a graph
被引:30
|
作者:
Fath-Tabar, Gholam Hossein
论文数: 0引用数: 0
h-index: 0
机构:
Univ Kashan, Dept Math, Fac Sci, Kashan 8731751167, IranUniv Zagreb, Fac Civil Engn, Zagreb 10000, Croatia
Fath-Tabar, Gholam Hossein
[2
]
论文数: 引用数:
h-index:
机构:
Doslic, Tomislav
[1
]
Ashrafi, Ali Reza
论文数: 0引用数: 0
h-index: 0
机构:
Univ Kashan, Dept Math, Fac Sci, Kashan 8731751167, Iran
Inst Res Fundamental Sci IPM, Sch Math, Tehran, IranUniv Zagreb, Fac Civil Engn, Zagreb 10000, Croatia
Ashrafi, Ali Reza
[2
,3
]
机构:
[1] Univ Zagreb, Fac Civil Engn, Zagreb 10000, Croatia
[2] Univ Kashan, Dept Math, Fac Sci, Kashan 8731751167, Iran
[3] Inst Res Fundamental Sci IPM, Sch Math, Tehran, Iran
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 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. (C) 2010 Elsevier Inc. All rights reserved.
机构:
Shahid Rajaee Teacher Training Univ, Fac Sci, Dept Math, Tehran 16785163, IranShahid Rajaee Teacher Training Univ, Fac Sci, Dept Math, Tehran 16785163, Iran
Ghorbani, Modjtaba
Vaziri, Zahra
论文数: 0引用数: 0
h-index: 0
机构:
Shahid Rajaee Teacher Training Univ, Fac Sci, Dept Math, Tehran 16785163, IranShahid Rajaee Teacher Training Univ, Fac Sci, Dept Math, Tehran 16785163, Iran