Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)

DOI10.1007/s00373-011-1057-7zbMath1256.05141OpenAlexW1963591475MaRDI QIDQ1926033

Li Zhang, Shuchao Li

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1057-7

zbMATH Keywords

diameterpermanentsignless Laplacian matrixunicyclic graph

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Further results on the star degree of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Computing the permanental polynomials of graphs ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ On the normalized Laplacian permanental polynomial of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• The signless Laplacian spectral radius of graphs with given degree sequences
• On some forests determined by their Laplacian or signless Laplacian spectrum
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• On graphs whose signless Laplacian index does not exceed 4.5
• Maximum permanents of matrices of zeros and ones
• Permanental polynomials of graphs
• Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
• On the permanent of certain \((0,1)\) Toeplitz matrices
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Permanental bounds for nonnegative matrices via decomposition
• An upper bound for permanents of nonnegative matrices
• An update on Minc's survey of open problems involving permanents
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Eigenvalue bounds for the signless laplacian
• The maximum clique and the signless Laplacian eigenvalues
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On three conjectures involving the signless Laplacian spectral radius of graphs
• New permanental upper bounds for nonnegative matrices
• Extending the minc-brègman upper bound for the permanent
• The Laplacian permanental polynomial for trees
• Signless Laplacians and line graphs
• The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints
• The Hadamard Theorem for Permanents
• Bounds for permanents of non-negative matrices
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)