The study of bounds for distance matrix of a graph
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
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
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
- Occupational accident analysis and modelling in oil and gas drilling sector Turkey(2021)
- XVI. yüzyıl Anadolu'sunda Oğuzların Karkın Boyu(2004)
- Experimental development of the interfacial bond-slip model between textile reinforced mortar strips and masonry walls(2025)
- Sharing of real life geometry samples via a social learning environment: A case study(2021)
- Evaluatıon of calcium hydroxide removal efficiency of two different irrigation activation techniques from artificial internal resorption cavities prepared at different root levels(2021)
- The use of verbal memory in the context of sustainability and power at the museums of Turk(2010)