42 citations · 121 across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
Ali Dehghan, Mohsen Mollahajiaghaei
An assignment of numbers to the vertices of graph G is closed distinguishing if for any two adjacent vertices v and u the sum of labels of the vertices in the closed neighborhood o…
math.PR2016★ 7 cited
Examples of interacting particle systems on as Pfaffian point processes: coalescing branching random walks and annihilating random walks with immigration
Barnaby Garrod, Roger Tribe, Oleg Zaboronski
Two classes of interacting particle systems on are shown to be Pfaffian point processes at fixed times, and for all deterministic initial conditions. The first compris…