English

Italian domination in generalized Petersen graphs

Combinatorics 2020-05-05 v1

Abstract

In a graph G=(V,E)G=(V,E), each vertex vVv\in V is labelled with 00, 11 or 22 such that each vertex labelled with 00 is adjacent to at least one vertex labelled 22 or two vertices labelled 11. Such kind of labelling is called an Italian dominating function (IDF) of GG. The weight of an IDF ff is w(f)=vVf(v)w(f)=\sum_{v\in V}f(v). The Italian domination number of GG is γI(G)=minfw(f)\gamma_{I}(G)=\min_{f} w(f). Gao et al. (2019) have determined the value of γI(P(n,3))\gamma_I(P(n,3)). In this article, we focus on the study of the Italian domination number of generalized Petersen graphs P(n,k)P(n, k), k3k\neq3. We determine the values of γI(P(n,1))\gamma_I(P(n, 1)), γI(P(n,2))\gamma_I(P(n, 2)) and γI(P(n,k))\gamma_I(P(n, k)) for k4k\ge4, k2,3(mod5)k\equiv2,3(\bmod5) and n0(mod5)n\equiv0(\bmod5). For other P(n,k)P(n,k), we present a bound of γI(P(n,k))\gamma_I(P(n, k)). With the obtained results, we partially solve the open problem presented by Bre\v{s}ar et al. (2007) by giving P(n,1)P(n,1) is an example for which γI=γr2\gamma_I=\gamma_{r2} and characterizing P(n,2)P(n,2) for which γI(P(n,2))=γr2(P(n,2))\gamma_I(P(n,2))=\gamma_{r2}(P(n,2)). Moreover, our results imply P(n,1)P(n,1) (n0(mod 4))(n\equiv0(\bmod\ 4)) is Italian, P(n,1)P(n,1) (n≢0(mod 4))(n\not\equiv0(\bmod\ 4)) and P(n,2)P(n,2) are not Italian.

Keywords

Cite

@article{arxiv.2005.01318,
  title  = {Italian domination in generalized Petersen graphs},
  author = {Hong Gao and Jiahuan Huang and Yanan Yin and Yuansheng Yang},
  journal= {arXiv preprint arXiv:2005.01318},
  year   = {2020}
}
R2 v1 2026-06-23T15:17:04.005Z