DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ilić, Aleksandar | en |
dc.contributor.author | Stevanović, Dragan | en |
dc.contributor.author | Feng, Lihua | en |
dc.contributor.author | Yu, Guihai | en |
dc.contributor.author | Dankelmann, Peter | en |
dc.date.accessioned | 2020-05-01T20:13:01Z | - |
dc.date.available | 2020-05-01T20:13:01Z | - |
dc.date.issued | 2011-04-28 | en |
dc.identifier.issn | 0166-218X | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1267 | - |
dc.description.abstract | Let G be a connected graph with vertex set V(G). The degree distance of G is defined as D′(G)=∑u,v⊆V(G)(degG(u)+degG(v))d(u,v), where degG(u) is the degree of vertex u, and d(u,v) denotes the distance between u and v. Here we characterize n-vertex unicyclic graphs with girth k, having minimum and maximum degree distance, respectively. Furthermore, we prove that the graph Bn, obtained from two triangles linked by a path, is the unique graph having the maximum degree distance among bicyclic graphs, which resolves a recent conjecture of Tomescu. | en |
dc.publisher | Elsevier | - |
dc.relation | NNSFC (Nos. 70901048, 10871205) | - |
dc.relation | NSFSD (Nos. BS2010SF017, Y2008A04) | - |
dc.relation | Serbian Ministry of Science, Project 144007 and 144015G | - |
dc.relation | Slovenian Agency for Research, Program P1-0285 | - |
dc.relation.ispartof | Discrete Applied Mathematics | en |
dc.subject | Bicyclic graph | Degree distance | Girth | Wiener index | en |
dc.title | Degree distance of unicyclic and bicyclic graphs | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.dam.2011.01.013 | en |
dc.identifier.scopus | 2-s2.0-79952538800 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 779 | en |
dc.relation.lastpage | 788 | en |
dc.relation.issue | 8 | en |
dc.relation.volume | 159 | en |
dc.description.rank | M22 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0003-2908-305X | - |
SCOPUSTM
Citations
54
checked on Mar 28, 2024
Page view(s)
45
checked on Mar 29, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.