Domination in generalized Petersen graphs.

碩士 === 國立中央大學 === 數學研究所 === 99 === A vertex subset S of a graph G is a dominating set if each vertex in V(G)−S is adjacent to at least one vertex in S. The domination number of G is the cardinality of a minimum dominating set of G, denoted by γ(G). A dominating set S is called an independent dominat...

Full description

Bibliographic Details
Main Authors: Yuan-shin Li, 李元馨
Other Authors: Sheng-Chyang Liaw
Format: Others
Language:en_US
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/25053155376826226509

Similar Items