Signed clique edge domination numbers of graphs
Abstract
Let γsci(G) be the signed clique edge domination number of G,and Kn1,n2,-,nt = Kn1 V Kn2 V... V K nt be a complete t-partite graphs. In this paper,we determine the signed clique edge domination numbers of Ki V Kn-i,where n > t > 0 and we resolve an open problem proposed in the monograph [2]: for t > 4, determine the signed clique edge domination numbers of complete t-partite graphs γsci(Kn1,n2,-,nt).











