The bounds of laplacian spectral radius of graph
2012
0 views
0 downloads
Advisor: Yrd. Doç. Dr. Şerife Büyükköse
Abstract (EN)
Let G = (V;E) be a graph. The L(G) matrix is denedL(G) =8<:d(vi) ; if i = j? 1 ; if i 6= j and vi vj0 ; if otherwiseThe largest eigenvalue of Laplacian matrix is called Laplacian spectral radius.In this study, we found bounds for eigenvalues of Laplacian spectral radiususing matrix norms.Keywords: Graph, Laplacian matrix, Laplacian spectral radius, Hadamardproduct, matrix norms.
Author
Dr. Soner Sezgin
How to Cite
Soner Sezgin (Master Thesis). The bounds of laplacian spectral radius of graph, 2012, Ahi Evran University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Ahi Evran University
- Relationship between emotional intelligence and organizational cynicism level of highschool teachers(2018)
- The examine of emphatic tendency of the classes which have mainstreami̇ng students(2018)
- Examination of the European Union and minority rights: Bulgaria case(2018)
- The postmodern elements in Mine Söğüt's novels(2018)
- Analysis of the compiled motifs tales and folk tales village of Arpaçay(2018)
- Paris in Turkish novel from II. Constitutionalism to 1922(2018)