Permanental bounds of the Laplacian matrix of trees with given domination number
From MaRDI portal
(Redirected from Publication:497337)
Recommendations
- Minimizing the Laplacian eigenvalues for trees with given domination number
- Further results on permanental bounds for the Laplacian matrix of trees
- On the Laplacian spectral radii of trees with given domination number
- Domination number and Laplacian eigenvalue of trees
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- scientific article; zbMATH DE number 1463398 (Why is no real title available?)
- A bound for the permanent of the Laplacian matrix
- An analytic approach to a permanent conjecture
- An upper bound for permanents of nonnegative matrices
- Bounds for permanents of non-negative matrices
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
- Extending the minc-brègman upper bound for the permanent
- Extremal graphs for inequalities involving domination parameters
- Further analysis on the total number of subtrees of trees
- Further results on permanental bounds for the Laplacian matrix of trees
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
- Maximum permanents of matrices of zeros and ones
- New permanental upper bounds for nonnegative matrices
- On graphs having domination number half their order
- On the corona of two graphs
- On the permanent of certain \((0,1)\) Toeplitz matrices
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanental bounds for nonnegative matrices via decomposition
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Permanental polynomials of graphs
- The Laplacian permanental polynomial for trees
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
Cited in
(11)- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- On the (signless) Laplacian permanental polynomials of graphs
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- Further results on permanental bounds for the Laplacian matrix of trees
- Graphs determined by the (signless) Laplacian permanental polynomials
- On the normalized Laplacian permanental polynomial of a graph
- On the Laplacian spectral radii of trees with given domination number
- Computing the permanental polynomials of graphs
- On the roots of (signless) Laplacian permanental polynomials of graphs
- Domination number and Laplacian eigenvalue of trees
This page was built for publication: Permanental bounds of the Laplacian matrix of trees with given domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497337)
