Journal of the Operations Research Society of China ›› 2013, Vol. 1 ›› Issue (3): 385-392.doi: 10.1007/s40305-013-0024-9
• Discrete Optimization • Previous Articles Next Articles
Online:
Published:
Abstract:
Let G = (V ,E) be a graph, for an element x ∈ V ∪E, the open total neighborhood of x is denoted by Nt (x) = {y|y is adjacent to x or y is incident with x,y ∈ V ∪ E}, and Nt [x] = Nt (x) ∪ {x} is the closed one. A function f : V (G) ∪ E(G)→ {−1, 0, 1} is said to be a mixed minus domination function (TMDF) of G if y∈Nt [x] f (y) 1 holds for all x ∈ V (G) ∪ E(G). The mixed minus domination number γ tm(G) of G is defined as γ tm(G) = min x∈V ∪E f (x)|f is a TMDF of G . In this paper, we obtain some lower bounds of the mixed minus domination number of G and give the exact values of γ tm(G) when G is a cycle or a path.
Key words: Mixed minus domination function , | Mixed minus domination number
Bao-Gen Xu · Xiang-Yang Kong. On the Mixed Minus Domination in Graphs[J]. Journal of the Operations Research Society of China, 2013, 1(3): 385-392.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-013-0024-9
https://www.jorsc.shu.edu.cn/EN/Y2013/V1/I3/385