圖的嚴(yán)格強(qiáng)控制數(shù)是圖的符號控制數(shù)的推廣，該文在圖的符號控制數(shù)的基礎(chǔ)上，研究了圖的嚴(yán)格強(qiáng)控制數(shù)，并且決定了一些圖的并的嚴(yán)格強(qiáng)控制數(shù)。通過對圖的并的嚴(yán)格強(qiáng)控制數(shù)的研究，進(jìn)一步得到了一些圖的并的嚴(yán)格強(qiáng)控制數(shù)與圖的階數(shù)的關(guān)系。
關(guān) 鍵 詞 嚴(yán)格強(qiáng)控制數(shù); 圖; 函數(shù); 奇偶性

Abstract In this paper, the signal majority domination number of graphs is generalized to strict majority domination number of graphs. We investigated the strict majority domination number of some unions of graphs based on the signal majority domination number of graphs. According to study for strict majority domination number of some unions of graphs, we determined the strict majority domination number of some unions of graphs and discuss relation the strict majority domination number of some unions of graphs and order number of graphs.
Key words strict majority domination number; graph; function; parity