THE SPLIT EDGE DOMINATION NUMBER OF A GRAPH

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

Received May 31, 2007

Abstract

An edge dominating set D of a graph is a split edge dominating set, if the induce subgraph is disconnected. The split edge domination number of G is the minimum cardinality of a split edge dominating set. In this paper, we study split edge dominating sets and obtain bounds for the split edge domination number. Also investigate, the relationship of with other known parameters of G.

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