DC FieldValueLanguage
dc.contributor.authorFeng, Lihuaen
dc.contributor.authorLi, Ziyuanen
dc.contributor.authorLiu, Weijunen
dc.contributor.authorLu, Luen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:12:56Z-
dc.date.available2020-05-01T20:12:56Z-
dc.date.issued2020-09-15en
dc.identifier.issn0096-3003en
dc.description.abstractThe Harary index of a graph G is defined as [Formula presented] where dG(u, v) is the distance between the vertices u and v. In this paper, we respectively determine the minimal Harary index among all unicyclic graphs with diameter 3 and all unicyclic graphs with diameter 4.en
dc.publisherElsevier-
dc.relationNSFC (Nos. 11671402, 11871479)-
dc.relationHunan Provincial Natural Science Foundation (Nos. 2016JJ2138, 2018JJ2479)-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofApplied Mathematics and Computationen
dc.subjectExtremal graph | Harary index | Unicyclic graphsen
dc.titleMinimal Harary index of unicyclic graphs with diameter at most 4en
dc.typeArticleen
dc.identifier.doi10.1016/j.amc.2020.125315en
dc.identifier.scopus2-s2.0-85083572454en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.volume381en
dc.description.rankM21a-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
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

4
checked on Oct 2, 2022

Page view(s)

36
checked on Oct 3, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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