組合數學研討會

主講者: 陳聖華 先生(國立台灣大學)
講題: Edge roman domination on graphs
時間: 2013-09-27 (Fri.)  15:30 - 17:00
地點: 數學所 617 研討室 (台大院區)
Abstract: Let $G=(V,E)$ be a simple graph. An \emph{edge Roman dominating function} on $G$ is a function $f:E(G)\rightarrow \{0,1,2\}$ satisfying that every edge $e_1$ for which $f(e_1)=0$ is adjacent to at least one edge $e_2$ for which $f(e_2)=2$. The \emph{weight} of a Roman dominating function is the value $f(E)=\sum_{e\in E(G)}f(e)$. The minimum weight $\gamma_{ER}(G)$ of a Roman dominating function on a graph $G$ is called the \emph{Roman domination number} of $G$ In this talk, we investigate some upper bounds using discharging method and other skills.
  || Close window ||