Permanental bounds of the Laplacian matrix of trees with given domination number
From MaRDI portal
Publication:497337
DOI10.1007/s00373-014-1451-zzbMath1327.05204OpenAlexW2079824621MaRDI QIDQ497337
Shuchao Li, Shuna Hu, Xianya Geng
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1451-z
Related Items (8)
Graphs determined by the (signless) Laplacian permanental polynomials ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Computing the permanental polynomials of graphs ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ 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
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
- A bound for the permanent of the Laplacian matrix
- On graphs having domination number half their order
- 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
- Extremal graphs for inequalities involving domination parameters
- Permanental bounds for nonnegative matrices via decomposition
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- An analytic approach to a permanent conjecture
- Further analysis on the total number of subtrees of trees
- An upper bound for permanents of nonnegative matrices
- On the corona of two graphs
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Further results on permanental bounds for the Laplacian matrix of trees
- Towards a spectral theory of graphs based on the signless Laplacian, I
- New permanental upper bounds for nonnegative matrices
- Extending the minc-brègman upper bound for the permanent
- The Laplacian permanental polynomial for trees
- Towards a spectral theory of graphs based on the signless Laplacian, III
- 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 of the Laplacian matrix of trees with given domination number
