eduzhai > Physical Sciences > Physics Sciences >

On Signed Domination of Grid Graph

  • Save

... pages left unread,continue reading

Document pages: 17 pages

Abstract: Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : V(G)→{−1,1} if for every vertex v ∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 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 = 6, 7 and arbitrary n.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×