Signed edge domination numbers of graphs

Authors

  • Ao, Guoyan
  • Hongxia
  • Renyuan
  • Jirimutu

Abstract

Let γsci(G) be the signed clique edge domination number of G, and γss(G) be the signed star domination number of G. In this paper, we determine the signed clique edge domination numbers of graph Pi VKn-1(n > i > 0) and C, vKn-1(n > i ≥ 3), and the signed star domination numbers of the generalized Petersen graphs. MSG: 05C69.

Published

2014-05-09

How to Cite

Ao, Guoyan, Hongxia, Renyuan, & Jirimutu. (2014). Signed edge domination numbers of graphs. Utilitas Mathematica, 93. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1059

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.