Spectral characterization of graphs whose second largest eigenvalue is less than 1
type: Item
instance of: scholarly article
title: Spectral characterization of graphs whose second largest eigenvalue is less than 1
zbMATH Open document ID: 1225.05171
author: Fenjin Liu
author: Jianfeng Wang
author: Qiongxiang Huang
published in: Linear Algebra and its Applications
publication date: 2011-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 5833878
zbMATH Keywords: spectrum
zbMATH Keywords: cospectral graphs
zbMATH Keywords: second largest eigenvalue
zbMATH Keywords: spectral characterization
MaRDI profile type: Publication
full work available at URL: j.laa.2010.06.011
OpenAlex ID: W2020517152
cites work: Q5648382
cites work: Q3672019
cites work: Which graphs are determined by their spectrum?
cites work: The complement of the path is determined by its spectrum
cites work: On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
cites work: Spectral characterizations of lollipop graphs
cites work: Sharp lower bounds on the eigenvalues of trees
cites work: The multi-fan graphs are determined by their Laplacian spectra
cites work: The spectral characterization of graphs of index less than 2 with no path as a component
cites work: On graphs with exactly one eigenvalue less than -1
cites work: Starlike trees are determined by their Laplacian spectrum
cites work: On the spectral characterization of T-shape trees
cites work: On unicyclic graphs whose second largest eigenvalue does not exceed 1
cites work: Q5474947
DOI: 10.1016/J.LAA.2010.06.011
description: scientific article; zbMATH DE number 5833878