搜索结果: 1-1 共查到“组合数学 computing”相关记录1条 . 查询时间(0.125 秒)
Computing global offensive alliances in Cartesian product graphs
Global offensive alliances domination Cartesian product graphs
2012/4/18
A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The globa...