M. Pilsniak

activity

20172023

most citedBounds for Distinguishing Invariants of Infinite Graphs

6 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

The Sierpiński Domination Number

Michael A. Henning, Sandi Klavžar, Elżbieta Kleszcz +1

Let $G$ and $H$ be graphs and let $f : V (G) \to V (H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$ , denoted by $G \otimes_{f} H$ , is defined…

math.CO2019★ 6 cited

Bounds for Distinguishing Invariants of Infinite Graphs

Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1

We consider infinite graphs. The distinguishing number $D (G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial aut…

cs.DM2017

Equitable neighbour-sum-distinguishing edge and total colourings

Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3

With any (not necessarily proper) edge $k$ -colouring $γ : E (G) ⟶ {1, \dots, k}$ of a graph $G$ ,one can associate a vertex colouring $σ_γ$ given by $σ\_γ(v)=\sum\_{e\ni v…