1 citations · 1 across the 4 of their papers we have counts for
5 papers
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…
Local algorithms for the prime factorization of strong product graphs
Marc Hellmuth, Wilfried Imrich, Werner Klöckl +1
The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant "approximate" prime f…
Cartesian products of directed graphs with loops
Wilfried Imrich, Iztok Peterin
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesi…
Multiple Kronecker Covering Graphs
Tomaz Pisanski, Wilfried Imrich
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be…