Pages that link to "Item:Q789402"
From MaRDI portal
The following pages link to Permanent of the Laplacian matrix of trees and bipartite graphs (Q789402):
Displaying 39 items.
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- Some extremal results on the connective eccentricity index of graphs (Q499166) (← links)
- On the largest eigenvalues of trees with perfect matchings (Q551881) (← links)
- On Estrada index of trees (Q609494) (← links)
- Permanental roots and the star degree of a graph (Q802573) (← links)
- On the minimal energy of trees with a given diameter (Q812656) (← links)
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number (Q848203) (← links)
- On the Laplacian spectral radii of trees (Q1043940) (← links)
- A bound for the permanent of the Laplacian matrix (Q1072613) (← links)
- Permanent of the Laplacian matrix of trees with a given matching (Q1107543) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Hook immanantal inequalities for Laplacians of trees (Q1362651) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- Immanantal invariants of graphs (Q1779385) (← links)
- Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number (Q1786880) (← links)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) (Q1926033) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial (Q2001606) (← links)
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) (← links)
- Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052) (← links)
- A modified Grassmann algebra approach to theorems on permanents and determinants (Q2273861) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- On the second Laplacian spectral moment of a graph (Q3073481) (← links)
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs (Q3082859) (← links)
- Graph complexity and the laplacian matrix in blocked experiments (Q3199446) (← links)
- Extremal values on the harmonic number of trees (Q3451415) (← links)
- Further results on permanental bounds for the Laplacian matrix of trees (Q3589196) (← links)
- Principal subpermanents of the Laplacian matrix (Q3731633) (← links)
- The Second Immanantal Polynomial and the Centroid of a Graph (Q3743320) (← links)
- Developments in the theory of graph spectra (Q4723771) (← links)
- Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
- Sharp lower bounds on the sum-connectivity index of trees (Q5101878) (← links)
- (Q5124691) (← links)
- On the extremal values of the eccentric distance sum of trees (Q5891484) (← links)
- Ordering trees by their largest eigenvalues (Q5898283) (← links)
- Ordering trees by algebraic connectivity (Q5905368) (← links)
- On the roots of (signless) Laplacian permanental polynomials of graphs (Q6083184) (← links)
- Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number (Q6145822) (← links)
- About the type of broom trees (Q6184800) (← links)
