Upper signed k-domination in a general graph

  • Authors:

  • Dejan Delić;Changping Wang

  • Affiliations:

  • Department of Mathematics, Ryerson University, Toronto, ON, Canada, M5B 2K3;Department of Mathematics, Ryerson University, Toronto, ON, Canada, M5B 2K3

  • Venue:
  • Information Processing Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.89

Visualization

Abstract

Let k be a positive integer, and let G=(V,E) be a graph with minimum degree at least k-1. A function f:V-{-1,1} is said to be a signed k-dominating function (SkDF) if @?"u"@?"N"["v"]f(u)=k for every v@?V. An SkDF f of a graph G is minimal if there exists no SkDF g such that gf and g(v)=