Mateusz Miotk

activity

20152025

most citedGraphs with equal domination and covering numbers

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

collaborators

6 papers

math.CO2025

Unique paired vs edge-vertex minimum dominating sets in trees

Mateusz Miotk, Michał Zakrzewski, Paweł Żyliński

We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.

math.CO2019

Disjoint dominating and 2-dominating sets in graphs

Mateusz Miotk, Jerzy Topp, Paweł Żyliński

A graph $G$ is a $D D_{2}$ -graph if it has a pair $(D, D_{2})$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_{2}$ is a 2-dominating set of $G$ . We provide…

math.CO2019★ 1 cited

Bipartization of graphs

Mateusz Miotk, Jerzy Topp, Paweł Żyliński

A dominating set of a graph $G$ is a set $D \subseteq V_{G}$ such that every vertex in $V_{G} - D$ is adjacent to at least one vertex in $D$ , and the domination number $γ (G)$ of $G$ is th…

math.CO2018★ 2 cited

Graphs with equal domination and covering numbers

Andrzej Lingas, Mateusz Miotk, Jerzy Topp +1

A dominating set of a graph $G$ is a set $D \subseteq V_{G}$ such that every vertex in $V_{G} - D$ is adjacent to at least one vertex in $D$ , and the domination number $γ (G)$ of $G$ is th…

math.CO2017

Graphs with equal domination and certified domination numbers

Magda Dettlaff, Magdalena Lemańska, Mateusz Miotk +3

A set $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_{G} - D$ is adjacent to at least one vertex in $D$ . The domination number (upper domination number…

cs.DM2015

Hangable Graphs

Mateusz Miotk, Jerzy Topp

Let $G = (V_{G}, E_{G})$ be a connected graph. The distance $d_{G} (u, v)$ between vertices $u$ and $v$ in $G$ is the length of a shortest $u - v$ path in $G$ . The eccentricity of a vertex $v$ …