Secure and Secure-dominating Set of Cartesian Product Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 99 === Let G=(V,E) be a graph, and S⊆ V(G). Defines P(S) is a power set of S, which is the set of all subsets of S. A function A : S→Ƥ (V(G) − S) is called an attack on S (in G) if A(u) ⊆ N(u) – S for all u ∈ S and A(u) ∩ A(v) = ∅ for all u, v ∈ S, u ? v . A function D...
Main Authors: | Kai-Ping Huang, 黃楷玶 |
---|---|
Other Authors: | Juan Su-Tzu |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93034222312575649647 |
Similar Items
-
Secure and secure-dominating sets of graphs
by: Yen-Hsuan Chang, et al.
Published: (2009) -
On Unique Minimum Dominating Sets in Some Cartesian Product Graphs
by: Hedetniemi Jason T.
Published: (2015-11-01) -
Domination number of Cartesian product of graphs
by: Wen Wang, et al.
Published: (2013) -
Power domination of the cartesian product of graphs
by: K.M. Koh, et al.
Published: (2016-04-01) -
On Total Domination in the Cartesian Product of Graphs
by: Brešar Boštjan, et al.
Published: (2018-11-01)