期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Partitioning a Graph into Defensive k-Alliances 被引量:1
1
作者 Ismael G.YERO Sergio BERMUDO +1 位作者 juan a.rodriguez-velazquez Jose M.SIGARRETA 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2011年第1期73-82,共10页
A defensive k-alliance in a graph is a set S of vertices with the property that every vertex in S has at least k more neighbors in S than it has outside of S. A defensive k-alliance S is called global if it forms a do... A defensive k-alliance in a graph is a set S of vertices with the property that every vertex in S has at least k more neighbors in S than it has outside of S. A defensive k-alliance S is called global if it forms a dominating Set. In this paper we study the problem of partitioning the vertex set of a graph into (global) defensive k-alliances. The (global) defensive k-alliance partition number of a graph Г = (V, E), ψkgd(F)) ψkd(F), is defined to be the maximum number of sets in a partition of V such that each set is a (global) defensive k-alliance. We obtain tight bounds on ψkd(F) and ψkgd(F) in terms of several parameters of the graph including the order, size, maximum and minimum degree, the algebraic connectivity and the isoperimetric number. Moreover, we study the close relationships that exist among partitions of F1 × F2 into (global) defensive (kl + k2)-alliances and partitions of Fi into (global) defensive ki-alliances, i ∈ {1, 2}. 展开更多
关键词 Defensive alliances dominating sets DOMINATION isoperimetric number
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部