The bounds of laplacian spectral radius of graph
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
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
Soner Sezgin
How to Cite
Soner Sezgin (Master Thesis). The bounds of laplacian spectral radius of graph, 2012, Kırşehir Ahi Evran University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Kırşehir Ahi Evran University
- In teaching of mathematical concept, the effect of storyline method on attitude and success(2013)
- Jean-Jacques Rousseau's thoughts on life science and education in his Work "emile"(2019)
- The effect of pre-breeding weights and placental characteristics on birth weight in Karayaka sheeps(2020)
- H. 1301 (M. 1884) in light of the yearbook dated hejaz province during the reign of Abdulhamid II (History and geography, social-cultural, economic, administrative-military structure)(2020)
- Proteinurin in diabetic patients effect on mortality(2022)
- Wind energy forecasting methods: A case study of the long short term memory model (LSTM)(2024)