Pages that link to "Item:Q1393403"
From MaRDI portal
The following pages link to A certain polynomial of a graph and graphs with an extremal number of trees (Q1393403):
Displaying 50 items.
- Graphs whose spectrum determined by non-constant coefficients (Q277495) (← links)
- On the spectral characterization of some unicyclic graphs (Q409334) (← links)
- A generalization of Boesch's theorem (Q409456) (← links)
- Laplacian spectral characterization of some graph products (Q445835) (← links)
- Some results on signless Laplacian coefficients of graphs (Q448373) (← links)
- On the complexity of a class of pyramid graphs and Chebyshev polynomials (Q474169) (← links)
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number (Q533757) (← links)
- Ordering of trees with fixed matching number by the Laplacian coefficients (Q551269) (← links)
- Schur convex functions on the spectra of graphs (Q595684) (← links)
- On the Laplacian coefficients of bicyclic graphs (Q712272) (← links)
- On the normalized Laplacian spectral radii of a graph and its line graph (Q827404) (← links)
- Some graphs determined by their spectra (Q840642) (← links)
- Weighted complexities of graph products and bundles (Q854826) (← links)
- Spectral characterizations of lollipop graphs (Q924315) (← links)
- The multi-fan graphs are determined by their Laplacian spectra (Q941355) (← links)
- Which wheel graphs are determined by their Laplacian spectra? (Q979802) (← links)
- On the Laplacian coefficients of unicyclic graphs (Q1014495) (← links)
- Laplacian spectrum of weakly quasi-threshold graphs (Q1014809) (← links)
- One special double starlike graph is determined by its Laplacian spectrum (Q1021857) (← links)
- Undirected simple connected graphs with minimum number of spanning trees (Q1025924) (← links)
- Spectral characterizations of sandglass graphs (Q1033076) (← links)
- On generic forms of complementary graphs (Q1056766) (← links)
- Nonisomorphic graphs with the same t-polynomial (Q1089010) (← links)
- Spanning tree formulas and Chebyshev polynomials (Q1106235) (← 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)
- D-optimal block designs with at most six varieties (Q1162329) (← 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)
- Connected graphs with a minimal number of spanning trees (Q1255959) (← links)
- On the distribution of eigenvalues of graphs (Q1297457) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- The number of spanning trees in a new lexicographic product of graphs (Q1616174) (← links)
- Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph (Q1684932) (← links)
- Complexity of graphs generated by wheel graph and their asymptotic limits (Q1686390) (← links)
- The number of spanning trees in the composition graphs (Q1718771) (← links)
- The number of spanning trees of the Cartesian product of regular graphs (Q1719076) (← links)
- On the spectra of nonsymmetric Laplacian matrices (Q1772727) (← links)
- Forest matrices around the Laplacian matrix (Q1855402) (← links)
- Laplacian spectra and spanning trees of threshold graphs (Q1917274) (← links)
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices (Q1952839) (← links)
- Asymptotic normality of Laplacian coefficients of graphs (Q2014147) (← links)
- On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels (Q2092462) (← links)
- Spanning trees of descendants of a complete graph (Q2109090) (← links)
- A special class of triple starlike trees characterized by Laplacian spectrum (Q2133195) (← links)
- Polynomial graph invariants and the KP hierarchy (Q2190734) (← links)
- Laplacian spectral characterization of (broken) dandelion graphs (Q2221071) (← links)
- Network reliability in Hamiltonian graphs (Q2234742) (← links)
