Two-out degree equitable domination in graphs

Document Type: Research Paper

Authors

1 University of mysore

2 University of Mysore

Abstract

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‎.

Keywords

Main Subjects

References

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
Transactions on Combinatorics

Volume 2, Issue 3
September 2013
Pages 13-19

Files

Share

How to cite

Statistics