**Volume 55 (2023)**

**Volume 54 (2022)**

**Volume 53 (2021)**

**Volume 52 (2020)**

**Volume 51 (2019)**

**Volume 50 (2018)**

**Volume 49 (2017)**

**Volume 48 (2016)**

**Volume 47 (2016)**

**Volume 46 (2015)**

**Volume 45 (2014)**

**Volume 44 (2013)**

**Volume 43 (2009)**

**Volume 42 (2008)**

**Volume 41 (2007)**

#### Keywords = Dynamic programming

Number of Articles: 2

##### On the domination number of generalized Petersen graphs

*Volume 52, Issue 2 , December 2020, , Pages 57-65*

#####
**Abstract **

Let $n$ and $k$ be integers such that $3\leq 2k+ 1 \leq n$.The generalized Petersen graph $GP(n, k)=(V,E) $ is the graph with $V=\{u_1, u_2,\ldots, u_n\}\cup\{v_1, v_2,\ldots, v_n\}$ and $E=\{u_iu_{i+1}, u_iv_i, v_iv_{i+k}: 1 \leq i \leq n\}$, whereaddition is in modulo $n$. A subset $D\subseteq V$ is ...
Read More
##### On computing total double Roman domination number of trees in linear time

*Volume 52, Issue 1 , June 2020, , Pages 131-137*