Reflexive line graphs of trees

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Živković, Dejan	en
dc.contributor.author	Anđelić, Milica	en
dc.contributor.author	da Fonseca, Carlos	en
dc.date.accessioned	2020-05-01T20:12:46Z	-
dc.date.available	2020-05-01T20:12:46Z	-
dc.date.issued	2016-03-01	en
dc.identifier.issn	0925-9899	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1120	-
dc.description.abstract	A graph is reflexive if the second largest eigenvalue of its adjacency matrix is less than or equal to 2. In this paper, we characterize trees whose line graphs are reflexive. It turns out that these trees can be of arbitrary order—they can have either a unique vertex of arbitrary degree or pendant paths of arbitrary lengths, or both. Since the reflexive line graphs are Salem graphs, we also relate some of our results to the Salem (graph) numbers.	en
dc.publisher	Springer Link	-
dc.relation.ispartof	Journal of Algebraic Combinatorics	en
dc.subject	Adjacency matrix \| Line graph \| Reflexive graph \| Salem graph \| Second largest eigenvalue \| Subdivision graph	en
dc.title	Reflexive line graphs of trees	en
dc.type	Article	en
dc.identifier.doi	10.1007/s10801-015-0640-z	en
dc.identifier.scopus	2-s2.0-84957439116	en
dc.relation.firstpage	447	en
dc.relation.lastpage	464	en
dc.relation.issue	2	en
dc.relation.volume	43	en
dc.description.rank	M21	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

5

checked on Nov 23, 2024

27

checked on Nov 23, 2024

Check