The study of bounds for distance matrix of a graph
2021
0 views
0 downloads
Advisor: Prof. Dr. Şerife Büyükköse
Abstract (EN)
The aim of this study is to develop a lower and upper bound for the largest eigenvalue of the distance matrix of any G graph.In this context,some basic definitions and concepts were first addressed and then statements in the literature were complied.Finally,the bounds are also developed and exemplified with their proofs.
Author
Dr. Sevtap Hamurkoparan
How to Cite
Sevtap Hamurkoparan (Master Thesis). The study of bounds for distance matrix of a graph, 2021, Gazi University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Gazi University
- Consumption preferences of university students: Ankara Haci Bayram Veli University and Çankaya University examples(2021)
- Theoretical investigation of the structural, electonic, elastic, phonon, thermodynamic and optical properties of XIn2O4 (X=Mg, Zn, Cd) compounds(2021)
- The fabrication of Au(MgO-PVP)/n-Si (MPS) Schottky barrier diodes and the investigation their electrical and dielectrical properties(2021)
- Development of boron containing electrolyte additive for lithium ion batteries(2021)
- Experimental development of the interfacial bond-slip model between textile reinforced mortar strips and masonry walls(2025)
- The effect of coaching support on preschool teacher's pre-literacy practices and pre-literacy skills of children(2021)