Reflexive Line Graphs of Trees and Salem Numbers

DC Field	Value	Language
dc.contributor.author	Anđelić, Milica	en
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Živković, Dejan	en
dc.date.accessioned	2020-05-01T20:12:45Z	-
dc.date.available	2020-05-01T20:12:45Z	-
dc.date.issued	2019-10-01	en
dc.identifier.issn	1660-5446	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1109	-
dc.description.abstract	An 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.publisher	Springer Link	-
dc.relation.ispartof	Mediterranean Journal of Mathematics	en
dc.subject	adjacency matrix \| Line graph \| reflexive graph \| Salem graph \| second largest eigenvalue \| subdivision graph	en
dc.title	Reflexive Line Graphs of Trees and Salem Numbers	en
dc.type	Article	en
dc.identifier.doi	10.1007/s00009-019-1399-6	en
dc.identifier.scopus	2-s2.0-85071516179	en
dc.relation.issue	5	en
dc.relation.volume	16	en
dc.description.rank	M21	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-

1

checked on Jun 1, 2024

85

checked on May 9, 2024

Check