THE SPLIT EDGE DOMINATION NUMBER OF A GRAPH

K. M. Yogeesha (India), N. D. Soner (India) and Sirous Ghobadi (India)

Received May 31, 2007

References:

[1] G. Chartland and S. Schuster, On the independence numbers of complementary graphs, Trans. New York Acad. Sci. Ser. II 36(3) (1974), 247-251. [2] G. Chartland and L. Lesniak, Graphs and Digraphs, Third Edition, Wadsworth and Brooks/Cole, Pacific Grove, California, 1996. [3] R. P. Gupta, Independence and Covering Numbers of Lines, Graphs and Total Graphs, Proof Techniques in Graph Theory, F. Harary, ed., Academic Press, New York, 1969. [4] F. Harary, Graph Theory, Addision-Weseley, Reading, Mass., 1972. [5] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998. [6] S. R. Jayaram, Line domination in graphs, Graphs and Combinatorics 3 (1987), 357-363. [7] V. R. Kulli and B. Janakiram, The split domination number of a graph, Graph Theory Notes of New York, New York Acad. Sci. 32 (1997), 16-19.

Keywords and phrases: graphs, edge dominating set, edge domination number, split edge dominating set, split edge domination number.