Decomposition of complete graphs into trees
Deducing Properties of Trees From Their Matula Numbers
Definizione dei clan binari e loro classificazione
L’albero binario (libero) è una struttura analoga a quella dei numeri naturali (standard), salvo che ci sono due operazioni di successivo. Nello studio degli alberi binari non standard, si ha bisogno di strutture ordinate che stiano a quella di albero binario libero come la struttura (ordinata) Z sta ad N. Si introducono perciò i clan binari e se ne studiano le classi di isomorfismo. Si dimostra che esse sono determinate dalle classi di similitudine delle successioni numerabili di 2 elementi, avendo...
Deformation and rigidity of simplicial group actions on trees.
Descendants and ascendants in binary trees.
Descendants in heap ordered trees or a triumph of computer algebra.
Descendants in increasing trees.
Description combinatoire des ultramétriques
Determinantal generating functions of colored spanning forests.
Determination of Large Families and Diameter of Equiseparable Trees
Determining the maximal degree of a tree given by its distance matrix
Dimension of amalgamated graphs and trees
Direction Trees.
Discovering hook length formulas by an expansion technique.
Disjoint Homotopic Paths and Trees in a Planar Graph.
Dissimilarity vectors of trees are contained in the tropical Grassmannian.
Distance defined by spanning trees in graphs
For a spanning tree T in a nontrivial connected graph G and for vertices u and v in G, there exists a unique u-v path u = u₀, u₁, u₂,..., uₖ = v in T. A u-v T-path in G is a u- v path u = v₀, v₁,...,vₗ = v in G that is a subsequence of the sequence u = u₀, u₁, u₂,..., uₖ = v. A u-v T-path of minimum length is a u-v T-geodesic in G. The T-distance from u to v in G is the length of a u-v T-geodesic. Let geo(G) and geo(G|T) be the set of geodesics and the set of T-geodesics respectively in G. Necessary...
Distance spectral radius of trees with fixed maximum degree.
Distances between rooted trees
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
Distinguishability of locally finite trees.