DC FieldValueLanguage
dc.contributor.authorMilosavljevć, Nikolaen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:12:59Z-
dc.date.available2020-05-01T20:12:59Z-
dc.date.issued2014-01-01en
dc.identifier.issn0340-6253en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1246-
dc.description.abstractDetour index of a connected graph is defined as the sum of the lengths of the longest paths between all pairs of its vertices. We derive expression for the detour index of hexagonal chains, the molecular graphs of unbranched catacondensed benzenoids, using which we show that the linear hexagonal chain has the minimum, while the zig-zag hexagonal chain has the maximum detour index.en
dc.publisherFaculty of Sciences, University of Kragujevac-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationSlovenian Research Agency, research grants P1-0285 and J1-4021-
dc.relation.ispartofMatchen
dc.titleDetour index of hexagonal chainsen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84922138285en
dc.relation.firstpage137en
dc.relation.lastpage152en
dc.relation.issue1en
dc.relation.volume72en
dc.description.rankM21-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2908-305X-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

5
checked on Jul 22, 2024

Page view(s)

30
checked on May 9, 2024

Google ScholarTM

Check


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