1 citations · 1 across the 4 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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…
cs.DM2017
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…
math.CO2017
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…