期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Constructive characterizations of(γp,γ)-and(γp,γpr)-trees
1
作者 CHEN Lei LU Chang-hong ZENG Zhen-bing 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2008年第4期475-480,共6页
Let G = (V, E) be a graph without isolated vertices. A set S lohtain in V is a domination set of G if every vertex in V - S is adjacent to a vertex in S, that is N[S] = V. The domination number of G, denoted by γ(... Let G = (V, E) be a graph without isolated vertices. A set S lohtain in V is a domination set of G if every vertex in V - S is adjacent to a vertex in S, that is N[S] = V. The domination number of G, denoted by γ(G), is the minimum cardinality of a domination set of G. A set S lohtain in V is a paired-domination set of G if S is a domination set of G and the induced subgraph G[S] has a perfect matching. The paired-domination number, denoted by γpr(G), is defined to be the minimum cardinality of a paired-domination set S in G. A subset S lohtain in V is a power domination set of G if all vertices of V can be observed recursively by the following rules: (i) all vertices in N[S] are observed initially, and (ii) if an observed vertex u has all neighbors observed except one neighbor v, then v is observed (by u). The power domination number, denoted by γp(G), is the minimum cardinality of a power domination set of G. In this paper, the constructive characterizations for trees with γp=γ and γpr = γp are provided respectively. 展开更多
关键词 domination power domination paired-domination tree
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部