海词手机词典

A dominating set D of a graph G is defined as a subset of vertices in G such that each vertex not in D is adjacent to at least one vertex of D.

播放读音 播放读音

以上内容独家创作,受著作权保护,侵权必究

海词词典,十七年品牌