A theorem on trees.
From MaRDI portal
Die graphische Darstellung vermöge eines tree ist von Cayley 1857 erfunden worden, um die durch eine Reihenfolge linearer partieller Differentiationsprocesse charakterisirte Operation in einfachere Operationen aufzulösen. Hier stellt der Verf. eine darauf bezügliche Anzahlformel auf und bringt sie in Zusammenhang mit der Anzahl der Glieder einer gelegentlich bei Borchardt auftretenden Determinante.
Cited in
(33)- The number of spanning trees in a superprism
- The number of spanning trees of E-extended power graphs associated with finite semigroups
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- A Telescopic Proof of Cayley’s Formula
- Tree enumeration polynomials on separable permutations
- Automata and coalgebras in categories of species
- Cayley’s Formula from Middle School Math
- Vector encoding of phylogenetic trees by ordered leaf attachment
- Skeletal generalizations of chip-firing games, parking functions, and Dyck paths
- Sapling: inferring and summarizing tumor phylogenies from bulk data using backbone trees
- Reversible transducers over infinite words
- Improved bounds for codes over trees
- Resistance distance and spanning trees of generalized multiple complete split-like graph
- On a conjecture regarding spanning tree edge dependences of planar graphs
- The complexity of power graph associated with finite p-groups
- ML degrees of Brownian motion tree models: star trees and root invariance
- Enumeration of labeled connected bipartite graphs with given Betti number
- Some equidistributed statistics and applications to hook length formulas
- ShockHash: near optimal-space minimal perfect hashing beyond brute-force
- An elaborate new proof of Cayley's formula
- Weighted Moon-type formulae for complete graphs and complete bipartite graphs
- Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
- Topology reconstruction in telecommunication networks: embedding operations research within deep learning
- Realizability in Matoušek unique sink orientations: characterization and complexity gap
- Ranking and unranking of the planar embeddings of a planar graph
- Partial groups as symmetric simplicial sets
- The Laplacian spectral moments of uniform hypergraphs
- The sum of edge lengths in random linear arrangements
- A construction of minimal coherent filling pairs
- Eigenvalues and factors: a survey
- The ordering of hypertrees and unicyclic hypergraphs by the traces of \(\mathcal{A} \alpha\)-tensor
- The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
- Localizing spanning trees and arbors to vertex-induced partitions
This page was built for publication: A theorem on trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1535643)
