پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,228 |
| تعداد مقالات | 67,753 |
| تعداد مشاهده مقاله | 115,089,001 |
| تعداد دریافت فایل اصل مقاله | 89,830,408 |
Super Pair Sum Labeling of Graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 2، دوره 49، شماره 2، اسفند 2017، صفحه 13-22 اصل مقاله (554.22 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2017.7973 | ||
| نویسندگان | ||
| R. Vasuki1؛ S. Arockiaraj2؛ P. Sugirtha3 | ||
| 1Department of Mathematics, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215,Tamil Nadu, INDIA | ||
| 2Department of Mathematics, Mepco Schlenk Engineering College, Sivakasi-626124, Tamil Nadu | ||
| 3Department of Mathematics Dr. Sivanthi Aditanar College of Engineering Tiruchendur-628 215,Tamil Nadu, INDIA. | ||
| چکیده | ||
| Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)\cup E(G)$ to $\{0, \pm 1, \pm2, \dots, \pm (\frac{p+q-1}{2})\}$ when $p+q$ is odd and from $V(G)\cup E(G)$ to $\{\pm 1, \pm 2, \dots, \pm (\frac{p+q}{2})\}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {\it super pair sum graph}. Here we study about the super pair sum labeling of some standard graphs. | ||
|
آمار تعداد مشاهده مقاله: 736 تعداد دریافت فایل اصل مقاله: 640 |
||