%0 Journal Article
%T The Signed Domination Number of Cartesian Product of Two Paths
%A Mohammad Hassan
%A Muhsin Al Hassan
%A Mazen Mostafa
%J Open Journal of Discrete Mathematics
%P 45-55
%@ 2161-7643
%D 2020
%I Scientific Research Publishing
%R 10.4236/ojdm.2020.102005
%X Let G be a finite connected simple graph with vertex set V(G) and edge set E(G). A function f:V(G) ¡ú {1,1} is a signed dominating function if for every vertex v¡ÊV(G), the closed neighborhood of v contains more vertices with function values 1 than with −1. The signed domination number ¦Ãs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate The signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 3, 4, 5 and arbitrary n.
%K Path
%K Cartesian Product
%K Signed Dominating Function
%K Signed Domination Number
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=98067