On some forests determined by their Laplacian or signless Laplacian spectrum

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Stanić, Zoran	en
dc.date.accessioned	2020-05-01T20:12:49Z	-
dc.date.available	2020-05-01T20:12:49Z	-
dc.date.issued	2009-07-01	en
dc.identifier.issn	0898-1221	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1157	-
dc.description.abstract	We consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs. We classify the graphs from the considered class into those which are determined, or not determined, by Laplacian, or signless Laplacian spectrum.	en
dc.publisher	Elsevier	-
dc.relation	Serbian Ministry of Science, Projects 144015D and 144032D	-
dc.relation.ispartof	Computers and Mathematics with Applications	en
dc.subject	(signless) Laplacian spectrum \| Cospectral graphs \| Smith graphs \| Spectral determination \| The largest eigenvalues	en
dc.title	On some forests determined by their Laplacian or signless Laplacian spectrum	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.camwa.2009.04.005	en
dc.identifier.scopus	2-s2.0-65749119954	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	171	en
dc.relation.lastpage	178	en
dc.relation.issue	1	en
dc.relation.volume	58	en
dc.description.rank	M21	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-

15

checked on Apr 15, 2024

24

checked on Apr 16, 2024

Check