Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
type: Item
instance of: scholarly article
title: Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
zbMATH Open document ID: 1256.05141
author: Shuchao Li
author: Li Zhang
published in: Graphs and Combinatorics
publication date: 2012-12-27T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 6118546
zbMATH Keywords: permanent
zbMATH Keywords: signless Laplacian matrix
zbMATH Keywords: unicyclic graph
zbMATH Keywords: diameter
MaRDI profile type: Publication
full work available at URL: s00373-011-1057-7
OpenAlex ID: W1963591475
cites work: Q3097395
cites work: Q4044717
cites work: Permanent of the Laplacian matrix of trees and bipartite graphs
cites work: Maximum permanents of matrices of zeros and ones
cites work: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
cites work: An update on Minc's survey of open problems involving permanents
cites work: On the permanent of certain \((0,1)\) Toeplitz matrices
cites work: Signless Laplacians and line graphs
cites work: Q4327350
cites work: Signless Laplacians of finite graphs
cites work: Eigenvalue bounds for the signless laplacian
cites work: Q4828550
cites work: Towards a spectral theory of graphs based on the signless Laplacian, I
cites work: Which graphs are determined by their spectrum?
cites work: Q4487457
cites work: The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints
cites work: On three conjectures involving the signless Laplacian spectral radius of graphs
cites work: Enumeration of cospectral graphs.
cites work: Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
cites work: The maximum clique and the signless Laplacian eigenvalues
cites work: The Hadamard Theorem for Permanents
cites work: Permanental polynomials of graphs
cites work: The Laplacian permanental polynomial for trees
cites work: Bounds for permanents of non-negative matrices
cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
cites work: An upper bound for permanents of nonnegative matrices
cites work: On some forests determined by their Laplacian or signless Laplacian spectrum
cites work: Extending the minc-brègman upper bound for the permanent
cites work: New permanental upper bounds for nonnegative matrices
cites work: Permanental bounds for nonnegative matrices via decomposition
cites work: The complexity of computing the permanent
cites work: On graphs whose signless Laplacian index does not exceed 4.5
cites work: Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
cites work: On the maximal signless Laplacian spectral radius of graphs with given matching number
cites work: The signless Laplacian spectral radius of graphs with given degree sequences
DOI: 10.1007/S00373-011-1057-7
description: scientific article; zbMATH DE number 6118546