Pages that link to "Item:Q1233439"
From MaRDI portal
The following pages link to Comparison of graphs by their number of spanning trees (Q1233439):
Displaying 24 items.
- Some extremal properties of the multiplicatively weighted Harary index of a graph (Q266010) (← links)
- On the extremal total reciprocal edge-eccentricity of trees (Q497777) (← links)
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications (Q498422) (← 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)
- Graphs with the maximum or minimum number of 1-factors (Q965940) (← links)
- On generic forms of complementary graphs (Q1056766) (← links)
- Nonisomorphic graphs with the same t-polynomial (Q1089010) (← links)
- Finding the graph with the maximum number of spanning trees (Q1146688) (← links)
- Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
- Spanning trees of extended graphs (Q1193532) (← 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)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- Tracking network dynamics: a survey using graph distances (Q1624818) (← links)
- Edge-grafting transformations on the average eccentricity of graphs and their applications (Q1701119) (← links)
- Laplacian spectra and spanning trees of threshold graphs (Q1917274) (← links)
- On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
- On the reformulated reciprocal sum-degree distance of graph transformations (Q2354719) (← links)
- Walks and paths in trees (Q2888879) (← links)
- On the complexity group of stable curves (Q2998860) (← links)
- On graphs with randomly deleted edges (Q3968971) (← links)
- Complete signed graphs with largest maximum or smallest minimum eigenvalue (Q6117351) (← links)
