7 citations · 14 across the 15 of their papers we have counts for
17 papers
Asymmetrizing infinite trees
Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2
A graph is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion of a graph is the minimum number of ver…
Bounds for Distinguishing Invariants of Infinite Graphs
Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1
We consider infinite graphs. The distinguishing number of a graph is the minimum number of colours in a vertex colouring of that is preserved only by the trivial aut…
Regular Graphs with Minimum Spectral Gap
M. Abdi, E. Ghorbani, W. Imrich
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with vertices is . This conjecture can…
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…
Distinguishing density and the Distinct Spheres Condition
Wilfried Imrich, Florian Lehner, Simon M. Smith
If a graph has distinguishing number 2, then there exists a partition of its vertex set into two parts, such that no nontrivial automorphism of fixes setwise the two parts.…
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…