2 citations · 2 across the 5 of their papers we have counts for
19 papers · 1 filter
Distinct Fringe Subtrees in Random Trees
Louisa Seelbach Benkner, Stephan Wagner
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees…
Extremal trees with fixed degree sequence
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
The greedy tree and the -tree are known to be extremal among trees with degree sequence with respect to various graph invariants.…
On the Collection of Fringe Subtrees in Random Binary Trees
Louisa Seelbach Benkner, Stephan Wagner
A fringe subtree of a rooted tree is a subtree consisting of one of the nodes and all its descendants. In this paper, we are specifically interested in the number of non-isomorphic…
On the probability that a random subtree is spanning
Stephan Wagner
We consider the quantity associated with a graph that is defined as the probability that a randomly chosen subtree of is spanning. Motivated by conjectures due to Ch…
The average size of matchings in graphs
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
In this paper, we consider the average size of independent edge sets, also called matchings, in a graph. We characterize the extremal graphs for the average size of matchings in ge…
On two subclasses of Motzkin paths and their relation to ternary trees
Helmut Prodinger, Sarah J. Selkirk, Stephan Wagner
Two subclasses of Motzkin paths, S-Motzkin and T-Motzkin paths, are introduced. We provide bijections between S-Motzkin paths and ternary trees, S-Motzkin paths and non-crossing tr…