DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorŽivković, Dejanen
dc.date.accessioned2020-05-01T20:12:45Z-
dc.date.available2020-05-01T20:12:45Z-
dc.date.issued2019-10-01en
dc.identifier.issn1660-5446en
dc.description.abstractAn elegant full characterization of reflexive line graphs of trees has proved to be quite difficult task. This paper tries to shed some more light on known results about such graphs by providing more numerical details regarding their structural composition. The paper also presents numerous results and ideas on the topic, as well as some observations with respect to the connection with Salem numbers.en
dc.publisherSpringer Link-
dc.relation.ispartofMediterranean Journal of Mathematicsen
dc.subjectadjacency matrix | Line graph | reflexive graph | Salem graph | second largest eigenvalue | subdivision graphen
dc.titleReflexive Line Graphs of Trees and Salem Numbersen
dc.typeArticleen
dc.identifier.doi10.1007/s00009-019-1399-6en
dc.identifier.scopus2-s2.0-85071516179en
dc.relation.issue5en
dc.relation.volume16en
dc.description.rankM21-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Show simple item record

SCOPUSTM   
Citations

1
checked on Nov 27, 2022

Page view(s)

17
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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