سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات161
تعداد شماره‌ها6,573
تعداد مقالات71,037
تعداد مشاهده مقاله125,525,495
تعداد دریافت فایل اصل مقاله98,787,963
Ponraj, R, Gayathri, A, Somasundaram, S. (1400). Pair Difference Cordiality of Some Snake and Butterfly Graphs. , 53(1), 149-163. doi: 10.22059/jac.2021.81649
R Ponraj; A Gayathri; S Somasundaram. "Pair Difference Cordiality of Some Snake and Butterfly Graphs". , 53, 1, 1400, 149-163. doi: 10.22059/jac.2021.81649
Ponraj, R, Gayathri, A, Somasundaram, S. (1400). 'Pair Difference Cordiality of Some Snake and Butterfly Graphs', , 53(1), pp. 149-163. doi: 10.22059/jac.2021.81649
Ponraj, R, Gayathri, A, Somasundaram, S. Pair Difference Cordiality of Some Snake and Butterfly Graphs. , 1400; 53(1): 149-163. doi: 10.22059/jac.2021.81649

Pair Difference Cordiality of Some Snake and Butterfly Graphs

Journal of Algorithms and Computation
دوره 53، شماره 1، شهریور 2021، صفحه 149-163    اصل مقاله (270.68 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2021.81649
نویسندگان
R Ponraj* 1؛ A Gayathri2؛ S Somasundaram3
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India
2Research Scholor,Reg.No:20124012092023 Department of Mathematics Manonmaniam Sundaranar University, Abhishekapati,Tirunelveli–627 012, India
3Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India
چکیده
\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 the pair difference cordial labeling behavior of some snake and butterfly graphs.
کلیدواژه‌ها
Triangular snake؛ Alternate triangular snake؛ Quadrilatral Snake؛ Alternate Quadrilatral Snake؛ Butter fly
آمار
تعداد مشاهده مقاله: 336
تعداد دریافت فایل اصل مقاله: 346





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب