Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/17383
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFurtula, Boris-
dc.contributor.authorGutman, Ivan-
dc.contributor.authorLin, Hong-
dc.date.accessioned2023-03-20T11:00:41Z-
dc.date.available2023-03-20T11:00:41Z-
dc.date.issued2013-
dc.identifier.issn0340-6253en_US
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/17383-
dc.description.abstractContinuing the preceding work [MATCH Commun. Math. Comput. Chem. 70 (2013) 000–000], we determine the first few trees whose all degrees are odd, having smallest and greatest Wiener index.en_US
dc.language.isoen_USen_US
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.sourceMATCH Communications in Mathematical and in Computer Chemistry-
dc.subjectDistance (in graph)en_US
dc.subjectWiener indexen_US
dc.subjecttreesen_US
dc.titleMore trees with all degrees odd having extremal Wiener indexen_US
dc.typearticleen_US
dc.description.versionPublisheden_US
dc.type.versionPublishedVersionen_US
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

375

Downloads(s)

18

Files in This Item:
File Description SizeFormat 
paper0090.pdf193.23 kBAdobe PDFThumbnail
View/Open


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