1 citations · 1 across the 6 of their papers we have counts for
6 papers
Counting Colored Trees
Stoyan Dimitrov, Nathan Fox, Kimberly Hadaway +2
We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors ca…
On the extrema of the mean subtree order of graphs
Stijn Cambie, Jorik Jooken, Stephan Wagner
It has been conjectured that the minimum and maximum of the mean subtree order among connected graphs of order are attained by the path and clique , respectively. Ex…
Some bounds on the spectral radius of connected threshold graphs
Péter Csikvári, Ivan Damnjanović, Dragan Stevanović +1
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as , so that…
A computer algebra package for bivariate asymptotics with explicit error terms
Benjamin Hackl, Stephan Wagner
Making use of a newly developed package in the computer mathematics system SageMath, we show how to perform a full asymptotic analysis of certain types of sums that occur frequentl…
Composition schemes: q-enumerations and phase transitions
Cyril Banderier, Markus Kuba, Stephan Wagner +1
Composition schemes are ubiquitous in combinatorics, statistical mechanics and probability theory. We give a unifying explanation to various phenomena observed in the combinatorial…
Bounding mean orders of sub--trees of -trees
Stijn Cambie, Bradley McCoy, Stephan Wagner +1
For a -tree , we prove that the maximum local mean order is attained in a -clique of degree and that it is not more than twice the global mean order. We also bound the…