| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Stevanović, Dragan | en |
| dc.date.accessioned | 2020-05-01T20:13:01Z | - |
| dc.date.available | 2020-05-01T20:13:01Z | - |
| dc.date.issued | 2010-12-01 | en |
| dc.identifier.issn | 0340-6253 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1269 | - |
| dc.description.abstract | Recently, it was conjectured by Gutman and Ashrafi that the complete graph Kn has the greatest edge-Szeged index among simple graphs with n vertices. This conjecture turned out to be false, but led Vukič ević to conjecture the coefficient 1/15552 of n6 for the approximate value of the greatest edge-Szeged index. We provide counterexamples to this conjecture. | en |
| dc.publisher | Faculty of Sciences, University of Kragujevac | - |
| dc.relation | Serbian Ministry of Science and Environmental Protection, research grant 144015G | - |
| dc.relation | Slovenian Agency for Research, program P1-0285 | - |
| dc.relation.ispartof | Match | en |
| dc.title | Counterexamples to conjectures on graphs with the greatest edge-szeged index | en |
| dc.type | Article | en |
| dc.identifier.scopus | 2-s2.0-79952481546 | en |
| dc.relation.firstpage | 603 | en |
| dc.relation.lastpage | 606 | en |
| dc.relation.issue | 3 | en |
| dc.relation.volume | 64 | en |
| dc.description.rank | M21a | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | Article | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| crisitem.author.orcid | 0000-0003-2908-305X | - |
SCOPUSTM
Citations
3
checked on Dec 27, 2024
Page view(s)
18
checked on Dec 27, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.