scientific article; zbMATH DE number 5123568

MaRDI QIDQ3421940zbMATH OpenFDO

Authors Irene Sciriha

Publication date 8 February 2007

zbMATH Keywords

treeadjacency matrixcharacteristic polynomialcliquecardspolynomial reconstruction problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Line graphs of trees with the largest eigenvalue multiplicity
• On multiple eigenvalues of trees
• Eigenvalues of matrices with tree graphs
• The multiplicity of eigenvalues of trees
• On the multiplicity of eigenvalues of trees
• A note on the multiplicities of the eigenvalues of a tree
• On the smallest eigenvalues of the line graphs of some trees
• On the multiple eigenvalue of Randić matrix of trees
• Thekth Laplacian eigenvalue of a tree
• A note on the \(k\)th eigenvalue of trees

Cited in

(3)

• Graphs with a common eigenvalue deck
• Graphs with least eigenvalue -2: ten years on
• An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3421940)