Seminar on Combinatorics

主講者: 1.晏衛根教授(集美大學) 2.藍國元博士(國立台灣大學)
講題: 1. Enumeration of Spanning Trees 2. On k-domination problems in graphs
時間: 2013-02-22 (Fri.)  14:00 - 17:00
地點: 數學所 617 研討室 (台大院區)
Abstract: 2.For a positive integer k, a k-dominating set of a graph G is a subset D$\subseteq $V(G) such that every vertex not in D is adjacent to at least k vertices in D. The k-domination problem is to determine a minimum k-dominating set of G. In this talk, we will mainly focus on algorithmic aspects of the k-domination problem in graphs. In addition, some recent results about the k-domination number are also discussed.
  || Close window ||