搜索结果: 1-2 共查到“理学 Cartesian product graphs”相关记录2条 . 查询时间(0.15 秒)
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...
A New Class of Antimagic Cartesian Product Graphs.
Antimagic Magic Labeling Regular graph Cartesian product
2012/11/30
An antimagic labeling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1; : : : ;m such that all n-vertex sums are pairwise distinct...