| تعداد نشریات | 126 |
| تعداد شمارهها | 7,095 |
| تعداد مقالات | 76,247 |
| تعداد مشاهده مقاله | 151,805,511 |
| تعداد دریافت فایل اصل مقاله | 113,860,600 |
Vertex Equitable Labeling of Double Alternate Snake Graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 2، دوره 46، شماره 1، اسفند 2015، صفحه 27-34 اصل مقاله (711.17 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2016.7923 | ||
| نویسندگان | ||
| P. Jeyanthi* 1؛ A. Maheswari2؛ M. Vijayalakshmi3 | ||
| 11Research Center, Department of Mathematics, Govindammal Aditanar College for women, Tiruchendur - 628 215, Tamilnadu,India | ||
| 22Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, India | ||
| 33Department of Mathematics, Dr.G.U. Pope College of Engineering, Sawyerpuram, Thoothukudi District, Tamilnadu, India | ||
| چکیده | ||
| Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the induced edge labels are 1, 2, 3, . . . , q. In this paper, we prove that DA(Tn)⊙K1, DA(Tn)⊙2K1(DA(Tn) denote double alternate triangular snake) and DA(Qn) ⊙ K1, DA(Qn) ⊙ 2K1(DA(Qn) denote double alternate quadrilateral snake) are vertex equitable graphs. | ||
| کلیدواژهها | ||
| vertex equitable labeling؛ vertex equitable graph؛ double alternate triangular snake؛ double alternate quadrilateral snake | ||
|
آمار تعداد مشاهده مقاله: 1,809 تعداد دریافت فایل اصل مقاله: 1,743 |
||