Title
Grafovi čija je najmanja karakteristična vrednost minimalna u nekim klasama grafova
Creator
Aleksić, Tatjana, 1982-
Copyright date
2012
Object Links
Select license
Autorstvo-Nekomercijalno 3.0 Srbija (CC BY-NC 3.0)
License description
Dozvoljavate umnožavanje, distribuciju i javno saopštavanje dela, i prerade, ako se navede ime autora na način odredjen od strane autora ili davaoca licence. Ova licenca ne dozvoljava komercijalnu upotrebu dela. Osnovni opis Licence: http://creativecommons.org/licenses/by-nc/3.0/rs/deed.sr_LATN Sadržaj ugovora u celini: http://creativecommons.org/licenses/by-nc/3.0/rs/legalcode.sr-Latn
Language
Serbian
Cobiss-ID
Theses Type
Doktorska disertacija
Other responsibilities
mentor
Petrović, Miroslav, 1947-
član komisije
Simić, Slobodan, 1948-
član komisije
Gutman, Ivan, 1947-
član komisije
Lepović, Mirko, 1958-
član komisije
Borovićanin, Bojana, 1973-
Academic Expertise
Prirodno-matematičke nauke
University
Univerzitet u Kragujevcu
Faculty
Prirodno-matematički fakultet
Format
PDF/A (listova)
description
Odbranjeno 08.10.2012.
Summary.
Abstract (en)
Spectral graph theory is an important interdisciplinary field of science and
mathematics in which methods of linear algebra are used to solve problems
in graph theory. It has numerous applications for modelling problems in chemistry,
computers science, medicine, economy, and physics, to name just a few. By representing a graph as an adjacency matrix, matrix theory can be applied to graph theory. Features of the graph can be investigated using the eigenvalues and the eigenvectors of the adjacency matrix, and these give us information about the graph’s structure. The eigenvalues of a graph G can be ordered decreasingly, where the first is denoted by (G) and is called the index
of the graph and the least eigenvalue is denoted by (G). A graph’s spread
s(G) is defined as the difference between the greatest and the least eigenvalue
of the graph’s adjacency matrix, i.e. s(G) = (G) − (G).
The principal topic of this doctoral thesis is the least eigenvalue of a graph.
The structure of a graph G that has the minimum least eigenvalue within a
certain class of graphs is determined. This graph is referred to as an extremal
graph.
Authors Key words
Teorija grafova
Authors Key words
519.1
Type
monograph
manuscript text - theses
Text
“Data exchange” service offers individual users metadata transfer in several different formats. Citation formats are offered for transfers in texts as for the transfer into internet pages. Citation formats include permanent links that guarantee access to cited sources. For use are commonly structured metadata schemes : Dublin Core xml and ETUB-MS xml, local adaptation of international ETD-MS scheme intended for use in academic documents.