Note on the spectral characterization of some cubic graphs with maximum number of triangles
From MaRDI portal
Publication:1931749
DOI10.1016/j.laa.2012.09.015zbMath1257.05085OpenAlexW2051728667MaRDI QIDQ1931749
Hong-Jian Lai, Fenjin Liu, Qiong Xiang Huang
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.09.015
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Unnamed Item
- The spectral characterization of \(\infty\)-graphs
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- Characterizing distance-regularity of graphs by the spectrum
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterizations of lollipop graphs
- Spectral characterization of the Hamming graphs
- The lollipop graph is determined by its spectrum
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- The complement of the path is determined by its spectrum
- Spectral characterization of some cubic graphs
- On the spectral characterization of T-shape trees
This page was built for publication: Note on the spectral characterization of some cubic graphs with maximum number of triangles