On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph

DOI10.1007/s10587-013-0048-7zbMath1299.05216OpenAlexW2045298704MaRDI QIDQ5408244

Wai Chee Shiu, Ji-Ming Guo, Jian Xi Li

Publication date: 9 April 2014

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143485

zbMATH Keywords

characteristic polynomialLaplacian matrixsignless Laplacian matrixnormalized Laplacian matrix

Mathematics Subject Classification ID

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

Related Items (15)

Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ Effects on the normalized Laplacian spectral radius of non-bipartite graphs under perturbation and their applications ⋮ Signless Laplacian spectral characterization of 4-rose graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ The smallest signless Laplacian spectral radius of graphs with a given clique number ⋮ Hodge Laplacians on Graphs ⋮ Characteristics polynomial of normalized Laplacian for trees ⋮ Computing the permanental polynomials of graphs ⋮ The signless Laplacian spectrum of rooted product of graphs ⋮ Maximizing the least signless Laplacian eigenvalue of unicyclic graphs ⋮ The largest normalized Laplacian spectral radius of non-bipartite graphs ⋮ Unnamed Item ⋮ On the characteristic polynomial of the power of a path. ⋮ Normalized algebraic connectivity of graphs ⋮ On the normalized Laplacian permanental polynomial of a graph

Cites Work

• Unnamed Item
• On the Laplacian spectral radius of trees with fixed diameter
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Ordering trees with algebraic connectivity and diameter
• The six classes of trees with the largest algebraic connectivity
• The ordering of trees and connected graphs by algebraic connectivity
• On the second largest Laplacian eigenvalue of trees
• Principles of combinatorics
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• Ordering trees by algebraic connectivity

This page was built for publication: On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph