DC Field | Value | Language |
---|---|---|
dc.contributor.author | Feng, Lihua | en |
dc.contributor.author | Li, Ziyuan | en |
dc.contributor.author | Liu, Weijun | en |
dc.contributor.author | Lu, Lu | en |
dc.contributor.author | Stevanović, Dragan | en |
dc.date.accessioned | 2020-05-01T20:12:56Z | - |
dc.date.available | 2020-05-01T20:12:56Z | - |
dc.date.issued | 2020-09-15 | en |
dc.identifier.issn | 0096-3003 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1218 | - |
dc.description.abstract | The 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.publisher | Elsevier | - |
dc.relation | NSFC (Nos. 11671402, 11871479) | - |
dc.relation | Hunan Provincial Natural Science Foundation (Nos. 2016JJ2138, 2018JJ2479) | - |
dc.relation | Graph theory and mathematical programming with applications in chemistry and computer science | - |
dc.relation.ispartof | Applied Mathematics and Computation | en |
dc.subject | Extremal graph | Harary index | Unicyclic graphs | en |
dc.title | Minimal Harary index of unicyclic graphs with diameter at most 4 | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.amc.2020.125315 | en |
dc.identifier.scopus | 2-s2.0-85083572454 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.volume | 381 | en |
dc.description.rank | M21a | - |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.orcid | 0000-0003-2908-305X | - |
crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php | - |
crisitem.project.fundingProgram | Directorate for Computer & Information Science & Engineering | - |
crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333 | - |
SCOPUSTM
Citations
5
checked on Apr 2, 2025
Page view(s)
24
checked on Jan 31, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.