Abstract
In a graph , each vertex is labelled with , or such that each vertex labelled with is adjacent to at least one vertex labelled or two vertices labelled . Such kind of labelling is called an Italian dominating function (IDF) of . The weight of an IDF is . The Italian domination number of is . Gao et al. (2019) have determined the value of . In this article, we focus on the study of the Italian domination number of generalized Petersen graphs , . We determine the values of , and for , and . For other , we present a bound of . With the obtained results, we partially solve the open problem presented by Brešar et al. (2007) by giving is an example for which and characterizing for which . Moreover, our results imply is Italian, and are not Italian.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.