40 citations · 172 across the 51 of their papers we have counts for
3 papers · 1 filter
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…