پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,230 |
| تعداد مقالات | 67,754 |
| تعداد مشاهده مقاله | 115,094,062 |
| تعداد دریافت فایل اصل مقاله | 89,844,254 |
Vertex Switching in 3-Product Cordial Graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 12، دوره 50، شماره 1، شهریور 2018، صفحه 185-188 اصل مقاله (308.27 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2018.68965 | ||
| نویسندگان | ||
| P. Jeyanthi* 1؛ A. Maheswari2؛ M. VijayaLakshmi3 | ||
| 1Principal and Head of the Research Centre,Department of Mathematics,Govindammal Aditanar College for Women,Tiruchendur,Tamilnadu,INDIA | ||
| 2Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, India. | ||
| 3Department of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram,Thoothukudi District, Tamil Nadu, India | ||
| چکیده | ||
| A mapping $f: V(G)\rightarrow\left\{0, 1, 2 \right\}$ is called 3-product cordial labeling if $\vert v_f(i)-v_f(j)\vert \leq 1$ and $\vert e_f(i)-e_f(j)\vert \leq 1$ for any $ i, j\in \{0, 1, 2\}$, where $v_f(i)$ denotes the number of vertices labeled with $i, e_f (i)$ denotes the number of edges $xy$ with $f(x)f(y)\equiv i(mod \ 3)$. A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we establish that vertex switching of wheel,gear graph and degree splitting of bistar are 3-product cordial graphs. | ||
|
آمار تعداد مشاهده مقاله: 166 تعداد دریافت فایل اصل مقاله: 136 |
||