scientific article; zbMATH DE number 3324508
From MaRDI portal
Publication:5602686
Cited in
(23)- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- On generic forms of complementary graphs
- Graph theory and molecular distribution. I: copolycondensation of polyfunctional monomers bearing identical reactive groups
- Formulas for the number of trees in certain incomplete graphs
- Coalescent random forests
- A certain polynomial of a graph and graphs with an extremal number of trees
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
- The number of spanning trees in a new lexicographic product of graphs
- The number of spanning trees in the composition graphs
- Generalized m series in tree enumeration
- Laplacian spectra and spanning trees of threshold graphs
- Sequential sampling of junction trees for decomposable graphs
- The eigenvalues of the Hessian matrices of the generating functions for trees with \(k\) components
- A limit characterization for the number of spanning trees of graphs
- Enumeration of spanning trees containing given subgraphs
- On the number of spanning trees of multi-star related graphs
- A formula for the number of spanning trees of a multi-star related graph
- On the number of spanning trees of a multi-complete/star related graph
- Lagrange inversion
- Component behaviour and excess of random bipartite graphs near the critical point
- On the chromatic number of random triangle-free graphs
- The eigenvalues of Hessian matrices of the complete and complete bipartite graphs
- Smith normal form and Laplacians
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602686)
