Signed clique edge domination numbers of graphs

Authors

  • Xia, Hong
  • Wei, Feng
  • Chunlei, Xu
  • Jirimutu

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

Published

2013-05-09

How to Cite

Xia, Hong, Wei, Feng, Chunlei, Xu, & Jirimutu. (2013). Signed clique edge domination numbers of graphs. Utilitas Mathematica, 90. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/993

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.