On some forests determined by their Laplacian or signless Laplacian spectrum

Authors:
Slobodan K. Simić;Zoran Stanić
Affiliations:
Mathematical Institute SANU, Knez Mihajlova 36, 11000 Belgrade, Serbia;Faculty of Mathematics, University of Belgrade, Studentski trg 16, 11000 Belgrade, Serbia
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 2
Cited 2

No starlike trees are cospectral

Discrete Mathematics
Enumeration of cospectral graphs

European Journal of Combinatorics - Special issue on algebraic combinatorics: in memory of J.J. Seidel

Trees with minimal Laplacian coefficients

Computers & Mathematics with Applications
Spectral determination of graphs whose components are paths and cycles

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

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.