3 papers
math.CO2018
Distinguishing locally finite trees
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color the vertices of such that the only color preserving automorphism is the…
math.CO2017
Distinguishing graphs of maximum valence 3
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color such that the only color preserving automorphism is the identity. We gi…
math.PR2017
On recurrence of the multidimensional Lindley process
Wojciech Cygan, Judith Kloas
A Lindley process arises from classical studies in queueing theory and it usually reflects waiting times of customers in single server models. In this note we study recurrence of i…