Published in
Elsevier, Computers and Mathematics with Applications, 1(58), p. 171-178, 2009
DOI: 10.1016/j.camwa.2009.04.005
Links
Tools
On some forests determined by their Laplacian or signless Laplacian spectrum
Journal article published in 2009 by
Slobodan K. Simic,
Zoran Stanic 
This paper is made freely available by the publisher.
Full text: Download
Published version:
archiving forbidden
Data provided by 
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.