搜索结果: 1-2 共查到“理学 Antimagic”相关记录2条 . 查询时间(0.055 秒)
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...
An antimagic labelling 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 distinc...