The signed star domination numbers of the Cartesian product graphs

Authors:
Changping Wang
Affiliations:
Department of Mathematics, Wilfrid Laurier University, Waterloo, Ont., Canada N2L 3C5
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 6
Cited 3

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
Majority domination in graphs

Selected papers of the 14th British conference on Combinatorial conference
The signed and minus k-subdomination numbers of comets

Discrete Mathematics
A note on the lower bounds of signed domination number of a graph

Discrete Mathematics
Extremal graphs for inequalities involving domination parameters

Discrete Mathematics
On signed edge domination numbers of graphs

Discrete Mathematics

Note: Signed star k-subdomination numbers in graphs

Discrete Applied Mathematics
Note: Signed star domatic number of a graph

Discrete Applied Mathematics
Upper signed k-domination in a general graph

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let G be a graph with vertex set V(G) and edge set E(G). A function f:E(G)-{-1,1} is said to be a signed star dominating function of G if @?"e"@?"E"""G"("v")f(e)=1 for every v@?V(G), where E"G(v)={uv@?E(G)|u@?V(G)}. The minimum of the values of @?"e"@?"E"("G")f(e), taken over all signed star dominating functions f on G, is called the signed star domination number of G and is denoted by @c"S"S(G). In this paper, a sharp upper bound of @c"S"S(GxH) is presented.