1) signed path domination number
符号路控制数
1.
In this paper we introduce the concept of signed path domination in graphs,give a lower bound for the signed path domination number γ~′_P(G) of a graph G,prove that γ~′_(T)1 holds for any non-trivial tree T,and determine the signed path domination numbersfor the complete t-partite graphs、cycles and wheels.
引入了图的符号路控制的概念,给出了图G的符号路控制数γ′p(G)的一个下界,证明了γ′p(T)1对任何非平凡的树T成立,确定了完全图、圈、完全多部图和轮图的符号路控制数,并提出了若干未解决的问题和猜想。
2) signed path domination function
符号路控制函数
3) algebraic sign control circuit
代数符号控制电路
4) signed domination number
符号控制数
1.
The signed domination number of a graph G, denoted γ S(G), equals the minimum weight of a signed dominating function.
图Ｇ的符号控制函数ｆ的权重ｆ（Ｖ）＝∑ｖ∈Ｖｆ（ｖ）的最小值定义为图Ｇ的符号控制数，记为γｓ（Ｇ）。
2.
The signed domination number of a graph G, denoted γS(G), equals the minimum weight of a signed dominating function of G.
图Ｇ的符号控制数等于Ｇ的一个符号控制函数的最小权重，记为γＳ（Ｇ）。
3.
To obtain efficient strict algorithms for determining the signed domination number in a graph which is NP-hard,some heuristic bounding strategies are proposed.
确定图的符号控制数是NP-难度的问题。
5) the signed domination number
符号控制数
1.
In this paper, we study the signed domination number of graphs and obtain a lower bound for a k-partite graph.
研究图的符号控制数,得到了n阶k部图的符号控制数的一个下界,当δ=2时这个界是精确的,并且给出了δ=2时一个达到下界的图例。
6) sign-controlled circuit
符号控制电路
补充资料：符号逻辑(见数理逻辑)
符号逻辑(见数理逻辑)
symbotic logic
tun叩Iuo”_符号逻辑(s，mb。牡clog玩)见数理逻择。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条