Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/12310
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGutman I.-
dc.contributor.authorFurtula, Boris-
dc.date.accessioned2021-04-20T20:31:43Z-
dc.date.available2021-04-20T20:31:43Z-
dc.date.issued2014-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/12310-
dc.description.abstract© 2015 by Taylor & Francis Group, LLC. A graph is a mathematical object defined as an ordered pair (V, E) of sets V and E, where V is a (finite or infinite) set of some unspecified elements, called vertices, and E is a set of some (ordered or unordered) pairs of elements of V, called edges. Thus, a graph is an abstract set-theoretical concept. As such, it cannot be viewed as something quantitative. Yet, for most applications of graphs, pertinent numerical indicators are needed, which requires that their structural aspects be quantified (see, for instance, [5,11,16,29,30,33,37,81,91,93,122]). This can be done in many different ways, depending on the nature of the intended application, or on the mathematical apparatus preferred.-
dc.rightsrestrictedAccess-
dc.sourceQuantitative Graph Theory: Mathematical Foundations and Applications-
dc.titleMetric-extremal graphs-
dc.typebookPart-
dc.identifier.doi10.1201/b17645-
dc.identifier.scopus2-s2.0-84960087106-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

129

Downloads(s)

4

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.