海词手机词典
  • 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.

    播放读音 播放读音