| تعداد نشریات | 44 |
| تعداد شمارهها | 1,877 |
| تعداد مقالات | 15,278 |
| تعداد مشاهده مقاله | 43,730,730 |
| تعداد دریافت فایل اصل مقاله | 17,563,048 |
Two-out degree equitable domination in graphs | ||
| Transactions on Combinatorics | ||
| مقاله 2، دوره 2، شماره 3، آذر 2013، صفحه 13-19 اصل مقاله (301.14 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2013.3018 | ||
| نویسندگان | ||
| Ali Sahal* 1؛ Veena Mathad2 | ||
| 1University of mysore | ||
| 2University of Mysore | ||
| چکیده | ||
| An equitable domination has interesting application in the context of social networks. In a network, nodes with nearly equal capacity may interact with each other in a better way. In the society persons with nearly equal status, tend to be friendly. In this paper, we introduce new variant of equitable domination of a graph. Basic properties and some interesting results have been obtained. | ||
| کلیدواژهها | ||
| Equitable Domination Number؛ Two-Out Degree Minimal Two-Out Degree Equitable Dominating set؛ Two-Out Degree Equitable Domatic Partition | ||
| مراجع | ||
|
A. Anitha, S. Arumugam and M. Chellali (2011) Equitable domination in graphs Discrete Math. Algorithms Appl. 3, 311-321
G. Chartrand and L. Lesniak (2005) Graphs and Digraphs Chapman and Hall. CRC, 4th edition
F. Harary and T. W. Haynes (2000) Double domination in graphs Ars Combin. 55, 201-213
T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998) Fundamentals of domination in graphs Marcel Dekker, New York
T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998) Domination in graphs, Advanced topics Marcel Dekker, New York
S. T. Hedetniemi and R. Laskar (1984) Connected domination in graphs Graph Theory and Combinatorics, B. Bollobas. Ed.
Academic Press, London , 209-217
V. Swaminathan and K. M. Dharmalingam (2011) Degree equitable domination on graphs Kragujevac J. Math. 35, 191-197
| ||
|
آمار تعداد مشاهده مقاله: 4,987 تعداد دریافت فایل اصل مقاله: 3,349 |
||