Graphs whose spectrum determined by non-constant coefficients

DOI10.1016/j.endm.2013.11.007zbMath1338.05154OpenAlexW1976692978MaRDI QIDQ277495

Dariush Kiani, Saieed Akbari, Maryam Mirzakhah

Publication date: 29 April 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2013.11.007

zbMATH Keywords

adjacency matrix of a graphcharacteristic polynomial of a graphLaplacian matrix of a graph

Mathematics Subject Classification ID

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

Cites Work

• Laplacian matrices of graphs: A survey
• A certain polynomial of a graph and graphs with an extremal number of trees
• Connections between Wiener index and matchings
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs whose spectrum determined by non-constant coefficients