Author:
Wang Haichao,Kim Hye Kyung
Abstract
In a digraph D = ( V ( D ) , A ( D ) ) , a two-valued function f : V ( D ) → { - 1 , 1 } defined on the vertices of D is called a signed dominating function if f ( N - [ v ] ) ≥ 1 for every v in D. The weight of a signed dominating function is f ( V ( D ) ) = ∑ v ∈ V ( D ) f ( v ) . The signed domination number γ s ( D ) is the minimum weight among all signed dominating functions of D. Let P m × C n be the Cartesian product of directed path P m and directed cycle C n . In this paper, the exact value of γ s ( P m × C n ) is determined for any positive integers m and n.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference29 articles.
1. Graphs and Digraphs;Chartrand,2005
2. Total Weak Roman Domination in Graphs
3. On the Secure Total Domination Number of Graphs
4. Domination in Graphs: Advanced Topics;Haynes,1998
5. Foundamentals of Domination in Graphs;Haynes,1998
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献