Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 11 3 2026 09 01 The extended irregular domination problem 717 737 14870 10.22049/cco.2024.30046.2289 EN Lorenzo Mella Dip. di Scienze Fisiche, Informatiche, Matematiche, Universitá degli Studi di Modena e Reggio Emilia, Via Campi 213/A, I-41125 Modena, Italy Anita Pasotti DICATAM - Sez. Matematica, Universitá degli Studi di Brescia, Via Branze 43, I-25123 Brescia, Italy Journal Article 2024 10 07 In this paper we introduce a new domination problem strongly related to the following one recently proposed by Broe, Chartrand and Zhang. One says that a vertex $v$ of a graph $\Gamma$ labeled with an integer $\ell$ dominates the vertices of $\Gamma$ having distance $\ell$ from $v$. An irregular dominating set of a given graph $\Gamma$ is a set $S$ of vertices of $\Gamma$, having distinct positive labels, whose elements dominate every vertex of $\Gamma$. Since it has been proven that no connected vertex transitive graph admits an irregular dominating set, here we introduce the concept of an \emph{extended} irregular dominating set, where we admit that precisely one vertex, labeled with 0, dominates itself. Then we present existence or non existence results of an extended irregular dominating set $S$ for several classes of graphs, focusing in particular on the case in which $S$ is as small as possible. We also propose two conjectures.    https://comb-opt.azaruniv.ac.ir/article_14870_c288dce3f5a09781bc4edd1e96a1ffce.pdf