پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,239 |
| تعداد مقالات | 67,849 |
| تعداد مشاهده مقاله | 115,377,824 |
| تعداد دریافت فایل اصل مقاله | 90,145,559 |
Pair difference cordial labeling of planar grid and mongolian tent | ||
| Journal of Algorithms and Computation | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 23 دی 1400 اصل مقاله (281.57 K) | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2022.85484 | ||
| چکیده | ||
| \noindent Let $G = (V, E)$ be a $(p,q)$ graph.\\ Define \begin{equation*} \rho = \begin{cases} \frac{p}{2} ,& \text{if $p$ is even}\\ \frac{p-1}{2} ,& \text{if $p$ is odd}\\ \end{cases} \end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\\ \noindent Consider a mapping $f : V \longrightarrow L$ by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when $p$ is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge $uv$ of $G$ there exists a labeling $\left|f(u) - f(v)\right|$ such that $\left|\Delta_{f_1} - \Delta_{f_1^c}\right| \leq 1$, where $\Delta_{f_1}$ and $\Delta_{f_1^c}$ respectively denote the number of edges labeled with $1$ and number of edges not labeled with $1$. A graph $G$ for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behavior of planar grid and mangolian tent graphs. | ||
| کلیدواژه‌ها | ||
| Path؛ Laddar؛ Planar grid؛ Mangolian tent | ||
|
آمار تعداد مشاهده مقاله: 129 تعداد دریافت فایل اصل مقاله: 77 |
||