Article ID Journal Published Year Pages File Type
472274 Computers & Mathematics with Applications 2009 8 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
On some forests determined by their Laplacian or signless Laplacian spectrum
Authors
, ,