DC FieldValueLanguage
dc.contributor.authorFowler, Patricken
dc.contributor.authorStevanović, Draganen
dc.contributor.authorMilošević, Markoen
dc.date.accessioned2020-05-01T20:13:02Z-
dc.date.available2020-05-01T20:13:02Z-
dc.date.issued2010-06-14en
dc.identifier.issn0340-6253en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1273-
dc.description.abstractChemical graphs (simple, connected graphs with maximum degree no greater than three) with eigenvalues ±√ 8 exist for all orders greater than nine, disproving a conjecture of J.R. Dias that no chemical graph with this pair of eigenvalues exists. In fact, the eigenvalue pair can be achieved with arbitrarily high multiplicity.en
dc.publisherFaculty of Sciences, University of Kragujevac-
dc.relationSerbian Ministry of Science, Grants 144015 and 144026-
dc.relationSlovenian Research Agency, Program P1-0285-
dc.relation.ispartofMatchen
dc.titleCounterexamples to a conjecture of Dias on eigenvalues of chemical graphsen
dc.typeArticleen
dc.identifier.scopus2-s2.0-77953271152en
dc.relation.firstpage727en
dc.relation.lastpage736en
dc.relation.issue3en
dc.relation.volume63en
dc.description.rankM21a-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

5
checked on Nov 24, 2024

Page view(s)

27
checked on Nov 24, 2024

Google ScholarTM

Check


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