Signless Laplacian polynomial and characteristic polynomial of a graph
DOI10.1155/2013/105624zbMath1295.05128OpenAlexW2089220457WikidataQ58919248 ScholiaQ58919248MaRDI QIDQ2249916
Harishchandra S. Ramane, Sumedha S. Shinde, Shaila B. Gudimani
Publication date: 4 July 2014
Published in: Journal of Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/105624
characteristic polynomial of induced subgraphscharacteristic polynomial of line graphscharacteristic polynomial of subdivision graphs
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph homomorphisms and nodal domains
- Signless Laplacians of finite graphs
- Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Eigenvalue bounds for the signless laplacian
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Signless Laplacians and line graphs
This page was built for publication: Signless Laplacian polynomial and characteristic polynomial of a graph