Note on the spectral characterization of some cubic graphs with maximum number of triangles
type: Item
instance of: scholarly article
title: Note on the spectral characterization of some cubic graphs with maximum number of triangles
zbMATH Open document ID: 1257.05085
author: Fenjin Liu
author: Hong-Jian Lai
author: Qiongxiang Huang
published in: Linear Algebra and its Applications
publication date: 2013-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6125873
zbMATH Keywords: cubic graphs
zbMATH Keywords: eigenvalues
zbMATH Keywords: graph spectrum
zbMATH Keywords: determined by adjacency spectrum
MaRDI profile type: Publication
full work available at URL: j.laa.2012.09.015
OpenAlex ID: W2051728667
cites work: Spectral characterization of the Hamming graphs
cites work: The lollipop graph is determined by its spectrum
cites work: Which graphs are determined by their spectrum?
cites work: Developments on spectral characterizations of graphs
cites work: Characterizing distance-regularity of graphs by the spectrum
cites work: The complement of the path is determined by its spectrum
cites work: Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
cites work: Spectral characterizations of lollipop graphs
cites work: The spectral characterization of \(\infty\)-graphs
cites work: On a signless Laplacian spectral characterization of \(T\)-shape trees
cites work: Spectral characterization of some cubic graphs
cites work: A course in combinatorics.
cites work: On the spectral characterization of T-shape trees
DOI: 10.1016/J.LAA.2012.09.015
description: scientific article; zbMATH DE number 6125873