آمار
| تعداد نشریات | 7 |
| تعداد شمارهها | 102 |
| تعداد مقالات | 1,142 |
| تعداد مشاهده مقاله | 1,049,176 |
| تعداد دریافت فایل اصل مقاله | 868,627 |
Signed total Italian k-domatic number of a graph | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 4، دوره 8، شماره 1، خرداد 2023، صفحه 39-52 اصل مقاله (405.61 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2021.27165.1207 | ||
| نویسنده | ||
| Lutz Volkmann* | ||
| RWTH Aachen University | ||
| چکیده | ||
| Let $k\ge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$. A signed total Italian $k$-dominating function on a graph $G$ is a function $f:V(G)\longrightarrow \{-1, 1, 2\}$ such that $\sum_{u\in N(v)}f(u)\ge k$ for every $v\in V(G)$, where $N(v)$ is the neighborhood of $v$, and each vertex $u$ with $f(u)=-1$ is adjacent to a vertex $v$ with $f(v)=2$ or to two vertices $w$ and $z$ with $f(w)=f(z)=1$. A set $\{f_1,f_2,\ldots,f_d\}$ of distinct signed total Italian $k$-dominating functions on $G$ with the property that $\sum_{i=1}^df_i(v)\le k$ for each $v\in V(G)$, is called a signed total Italian $k$-dominating family (of functions) on $G$. The maximum number of functions in a signed total Italian $k$-dominating family on $G$ is the signed total Italian k-domatic number of $G$, denoted by $d_{stI}^k(G)$. In this paper we initiate the study of signed total Italian k-domatic numbers in graphs, and we present sharp bounds for $d_{stI}^k(G)$. In addition, we determine the signed total Italian k-domatic number of some graphs. | ||
| کلیدواژهها | ||
| Signed total Italian k-dominating function؛ Signed total Italian k-domination number؛ Signed total Italian k-domatic number | ||
| مراجع | ||
|
[1] M. Chellali, N. Jafari Rad, S.M. Sheikholeslami, and L. Volkmann, The Roman domatic problem in graphs and digraphs: A survey, Discuss. Math. Graph Theory (to appear).
[2] E.J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977), no. 3, 247–261.
[3] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
[4] E.A. Nordhaus and J.W. Gaddum, On complementary graphs, Amer. Math. Monthly 63 (1956), no. 3, 175–177.
[5] P.J. Slater and E.L. Trees, Multi-fractional domination, J. Combin. Math. Combin. Comput. 40 (2002), 171–182.
[6] L. Volkmann, On the signed total Roman domination and domatic numbers of graphs, Discrete Appl. Math. 214 (2016), 179–186.
[7] L. Volkmann, Signed total Roman domination in graphs, J. Comb. Optim. 32 (2016), no. 3, 855–871. [8] L. Volkmann, The signed total Roman k-domatic number of a graph, Discuss. Math. Graph Theory 37 (2017), no. 4, 1027–1038. [9] L. Volkmann, Signed total Roman k-domination in graphs, J. Combin. Math. Combin. Comput. 105 (2018), 105–116.
[10] L. Volkmann, Signed total Italian domination in graphs, J. Combin. Math. Combin. Comput. 115 (2020), 291–305.
[11] L. Volkmann, Signed total Italian k-domination in graphs, Commun. Comb. Optim. 6 (2021), no. 2, 171–183.
| ||
|
آمار تعداد مشاهده مقاله: 361 تعداد دریافت فایل اصل مقاله: 646 |
||