The study of Roman domination number
碩士 === 淡江大學 === 數學學系碩士班 === 102 === Given a graph G = (V, E). We define a function f from V to {0, 1, 2}. The function f is called a Roman dominating function on G when satisfying the condition that every vertex v_i with f(v_i)=0 must be adjacent to at least one vertex v_j with f(v_j)=2. The weight...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/88729997653347165599 |