June 10, 2023
Doost Ali Mojdeh

Doost Ali Mojdeh

Degree: Professor
Address: Department of Mathematics, University of Mazandaran, Babolsar, Iran
Education: Ph.D in Mathematics (Graph Theory and Combinatorics)
Phone: 011-35302448
Faculty: Faculty of Mathematical Sciences


Title Total domination in cubic Knodel graphs
Type Article
Knodel graph, domination number, total domination number, Pigeonhole Principle
Journal Communications in Combinatorics and Optimization
DOI 10.22049/CCO.2020.26793.1143
Researchers Doost Ali Mojdeh (First researcher) , Seyed Reza Musawi (Second researcher) , Esmail Nazari (Third researcher) , Nader Jafari Rad (Fourth researcher)


A subset $D$ of vertices of a graph $G$ is a \textit{dominating set} if for each $u\in V(G) \setminus D$, $u$ is adjacent to some vertex $v\in D$. The \textit{domination number}, $\gamma(G)$ of $G$, is the minimum cardinality of a dominating set of $G$. A set $D\subseteq V(G)$ is a \textit{total dominating set} if for each $u\in V(G)$, $u$ is adjacent to some vertex $v\in D$. The \textit{total domination number}, $\gamma_{t}(G)$ of $G$, is the minimum cardinality of a total dominating set of $G$. For an even integer $n\ge 2$ and $1\le \Delta \le \lfloor\log_2n\rfloor$, a \textit{Kn\"odel graph} $W_{\Delta,n}$ is a $\Delta$-regular bipartite graph of even order $n$, with vertices $(i,j)$, for $i=1,2$ and $0\le j\le n/2-1$, where for every $j$, $0\le j\le n/2-1$, there is an edge between vertex $(1, j)$ and every vertex $(2,(j+2^k-1)$ mod (n/2)), for $k=0,1,\cdots,\Delta-1$. In this paper, we determine the total domination number in $3$-regular Kn\"odel graphs $W_{3,n}$.