Приказ основних података о дисертацији

dc.contributor.advisorPetrović, Miroslav
dc.contributor.otherSimić, Slobodan
dc.contributor.otherGutman, Ivan
dc.contributor.otherLepović, Mirko
dc.contributor.otherBorovićanin, Bojana
dc.creatorAleksić, Tatjana
dc.date.accessioned2016-01-05T13:06:23Z
dc.date.available2016-01-05T13:06:23Z
dc.date.available2020-07-03T15:07:02Z
dc.date.issued2012-10-08
dc.identifier.urihttp://eteze.kg.ac.rs/application/showtheses?thesesId=89
dc.identifier.urihttps://nardus.mpn.gov.rs/handle/123456789/3625
dc.identifier.urihttps://fedorakg.kg.ac.rs/fedora/get/o:142/bdef:Content/download
dc.description.abstractSpectral 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.en
dc.formatapplication/pdf
dc.languagesr
dc.publisherУниверзитет у Крагујевцу, Природно-математички факултетsr
dc.relationinfo:eu-repo/grantAgreement/MESTD/Basic Research (BR or ON)/174033/RS//
dc.rightsopenAccessen
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.sourceУниверзитет у Крагујевцуsr
dc.subjectTeorija grafovasr
dc.subject519.1en
dc.titleGrafovi čija je najmanja karakteristična vrednost minimalna u nekim klasama grafovasr
dc.typedoctoralThesisen
dc.rights.licenseBY-NC
dcterms.abstractПетровић, Мирослав; Гутман, Иван; Боровићанин, Бојана; Симић, Слободан; Леповић, Мирко; Aлексић, Татјана; Графови чија је најмања карактеристична вредност минимална у неким класама графова; Графови чија је најмања карактеристична вредност минимална у неким класама графова;
dc.identifier.fulltexthttp://nardus.mpn.gov.rs/bitstream/id/47094/Disertacija.pdf
dc.identifier.fulltexthttps://nardus.mpn.gov.rs/bitstream/id/47094/Disertacija.pdf
dc.identifier.doi10.2298/kg20121008aleksic
dc.identifier.rcubhttps://hdl.handle.net/21.15107/rcub_nardus_3625


Документи за докторску дисертацију

Thumbnail

Ова дисертација се појављује у следећим колекцијама

Приказ основних података о дисертацији