Pages that link to "Item:Q5961460"
From MaRDI portal
The following pages link to Transformations of a graph increasing its Laplacian polynomial and number of spanning trees (Q5961460):
Displaying 16 items.
- Spectra of digraph transformations (Q389597) (← links)
- Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications (Q585321) (← links)
- Schur convex functions on the spectra of graphs (Q595684) (← links)
- Solutions of some further graph equations (Q1055789) (← links)
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692) (← links)
- Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
- Comparison of graphs by their number of spanning trees (Q1233439) (← links)
- Nonisomorphic trees with the same T-polynomial (Q1243732) (← links)
- On the distribution of eigenvalues of graphs (Q1297457) (← links)
- A certain polynomial of a graph and graphs with an extremal number of trees (Q1393403) (← links)
- Tracking network dynamics: a survey using graph distances (Q1624818) (← links)
- Laplacian spectra and spanning trees of threshold graphs (Q1917274) (← links)
- On the Laplacian coefficients of graphs under some transformations (Q2435481) (← links)
- Laplacian spectra of digraph transformations (Q2979456) (← links)
- Detection of core–periphery structure in networks using spectral methods and geodesic paths (Q4594616) (← links)
- (Q5461426) (← links)
