Permanental bounds of the Laplacian matrix of trees with given domination number
type: Item
instance of: scholarly article
title: Permanental bounds of the Laplacian matrix of trees with given domination number
zbMATH Open document ID: 1327.05204
author: Xianya Geng
author: Shuna Hu
author: Shuchao Li
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6484817
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: permanent
zbMATH Keywords: tree
zbMATH Keywords: domination number
MaRDI profile type: Publication
full work available at URL: s00373-014-1451-z
OpenAlex ID: W2079824621
cites work: A bound for the permanent of the Laplacian matrix
cites work: Q4044717
cites work: Permanent of the Laplacian matrix of trees and bipartite graphs
cites work: Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
cites work: Towards a spectral theory of graphs based on the signless Laplacian, I
cites work: Towards a spectral theory of graphs based on the signless Laplacian. II.
cites work: Towards a spectral theory of graphs based on the signless Laplacian, III
cites work: On the permanent of certain \((0,1)\) Toeplitz matrices
cites work: Q4487457
cites work: Bounds for permanents of non-negative matrices
cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
cites work: On graphs having domination number half their order
cites work: On the corona of two graphs
cites work: Further results on permanental bounds for the Laplacian matrix of trees
cites work: Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
cites work: Further analysis on the total number of subtrees of trees
cites work: Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
cites work: Maximum permanents of matrices of zeros and ones
cites work: The Laplacian permanental polynomial for trees
cites work: Permanental polynomials of graphs
cites work: Q4184984
cites work: Q3291034
cites work: An upper bound for permanents of nonnegative matrices
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: Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
cites work: Extremal graphs for inequalities involving domination parameters
cites work: An analytic approach to a permanent conjecture
DOI: 10.1007/S00373-014-1451-Z
description: scientific article; zbMATH DE number 6484817