Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra

DOI10.13001/1081-3810.1373zbMath1205.05151OpenAlexW1580588882MaRDI QIDQ3075140

Ebrahim Vatandoost, Gholam Reza Omidi

Publication date: 10 February 2011

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/224057

zbMATH Keywords

starlike treescospectral graphsspectra of graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (14)

A special class of triple starlike trees characterized by Laplacian spectrum ⋮ Signless Laplacian determination for a family of double starlike trees ⋮ The spectral characterization of wind-wheel graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ On the eigenvalues and spectral radius of starlike trees ⋮ Signless Laplacian determinations of some graphs with independent edges ⋮ Pharmacological Characteristics Analysis of Two Molecular Structures ⋮ Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\) ⋮ Unnamed Item ⋮ Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ Spectral characterization of line graphs of starlike trees ⋮ Laplacian spectral characterization of some unicyclic graphs ⋮ Vertex-degree-based topological indices over starlike trees

This page was built for publication: Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra