DC FieldValueLanguage
dc.contributor.authorGhebleh, Mohammaden
dc.contributor.authorKanso, Ali Adelen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:12:58Z-
dc.date.available2020-05-01T20:12:58Z-
dc.date.issued2016-04-30en
dc.identifier.issn0096-3003en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1234-
dc.description.abstractAn open quipu is a tree constructed by attaching a pendant path to every internal vertex of a path. We show that the graph equation W(L2(T))=W(T) has infinitely many non-homeomorphic solutions among open quipus. Here W(G) and L(G) denote the Wiener index and the line graph of G respectively. This gives a positive answer to the 2004 problem of Dobrynin and Mel'nikov on the existence of solutions with arbitrarily large number of arbitrarily long pendant paths, and disproves the 2014 conjecture of Knor and Škrekovski.en
dc.publisherElsevier-
dc.relationKuwait University Research, Grant no. SM02/15-
dc.relation.ispartofApplied Mathematics and Computationen
dc.subjectGraph equation | Iterated line graph | Tree | Wiener indexen
dc.titleOpen quipus with the same Wiener index as their quadratic line graphen
dc.typeArticleen
dc.identifier.doi10.1016/j.amc.2016.01.040en
dc.identifier.scopus2-s2.0-84958231513en
dc.relation.firstpage130en
dc.relation.lastpage136en
dc.relation.volume281en
dc.description.rankM21-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

3
checked on Apr 17, 2024

Page view(s)

27
checked on Apr 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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