“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.
Export
Divnić, Tomica, 1969-
Neki rezultati o ekstremnim vrednostima Randićevog indeksa na grafovima
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, čak i u komercijalne svrhe. Ovo je najslobodnija od svih licenci. Osnovni opis Licence: http://creativecommons.org/licenses/by/3.0/rs/deed.sr_LATN Sadržaj ugovora u celini: http://creativecommons.org/licenses/by/3.0/rs/legalcode.sr-Latn
Academic metadata
Doktorska disertacija
Prirodno-matematičke nauke
Univerzitet u Kragujevcu
Prirodno-matematički fakultet
Other Theses Metadata
Kragujevac : [T. Divnić],
PDF/A (listova)
datum odbrane: 12.10.2013.
Pavlović, Ljiljana, 1954- (mentor)
Kovačević-Vujčić, Vera, 1947- (član komisije)
Petrović, Miroslav, 1947- (član komisije)
This doctoral dissertation belongs to the Combinatorial Optimization applied to
graphs, which includes elements of Linear and Quadratic Programming and Graph
Theory.
Combinatorial Optimization, as special mathematical discipline, is relatively young, although the first papers are more than two hundred years old. The fast
development emerges after the second wold war, when grows need for optimization
many tasks and processes. Since many objects could be represents as graph and
combinatorial optimization solve extremal problems on discrete structures, there is narrow connection with Graph Theory.
The subject of this dissertation is finding minimal value of the Randi´c index on
n-vertex graphs G(k, n) with given minimum degree k of vertices and describing the
structure of extremal graphs. This index was introduced 1975 by chemist Milan
Randi´c in order to measure the branching of some molecules. There is a good
correlations between this index and some physico-chemical properties of alcanes.
There is, also, connection between Randi´c index and the eigenvalues of the Laplacian matrix of graph.
519.852:519.17(043.3)
Randićev indeks
Grafovi
Serbian
519500949, D-2633
monograph
manuscript text - theses
Text
This doctoral dissertation belongs to the Combinatorial Optimization applied to
graphs, which includes elements of Linear and Quadratic Programming and Graph
Theory.
Combinatorial Optimization, as special mathematical discipline, is relatively young, although the first papers are more than two hundred years old. The fast
development emerges after the second wold war, when grows need for optimization
many tasks and processes. Since many objects could be represents as graph and
combinatorial optimization solve extremal problems on discrete structures, there is narrow connection with Graph Theory.
The subject of this dissertation is finding minimal value of the Randi´c index on
n-vertex graphs G(k, n) with given minimum degree k of vertices and describing the
structure of extremal graphs. This index was introduced 1975 by chemist Milan
Randi´c in order to measure the branching of some molecules. There is a good
correlations between this index and some physico-chemical properties of alcanes.
There is, also, connection between Randi´c index and the eigenvalues of the Laplacian matrix of graph.
https://phaidrakg.kg.ac.rs/detail_object/o:244?tab=0#mda
