1) total signed domination number
全符号控制数
1.
The total signed domination function and total signed domination number of graphs are defined,and some results of total signed domination number of some special graphs are obtained.
定义了图的全符号控制函数及其全符号控制数 ,并得到了若干图的全符号控制数的
2) signed edge total domination number
符号边全控制数
1.
In this paper we introduce the concept of signed edge total domination number γ~′_(st)(G) of a graph G,characterize all connected graphs with δ(G)2 and γ~′_(st)(G)=｜E(G)｜.
引入了图的符号边全控制的概念,主要刻划了满足sγt′(G)=|E(G)|且δ(G)2的所有连通图G,给出了n阶k-正则图G的符号边全控制数γst′(G)的下限,确定所有轮图的符号边全控制数,最后还提出了一个关于sγ′t(G)上界的猜想。
2.
We introduce the concept of signed edge total domination in graphs,obtain a lower bound for the signed edge total domination numbers of graphs,and determine the smallest signed edge total domination number for all tree of order n,and characterize all connected graphs with γ′st(G)=|E(G)|.
引入了图的符号边全控制的概念,给出了一个连通图G的符号边全控制数γs′t(G)的下限,确定所有n阶树T的最小符号边全控制数,并刻划了满足γs′t(G)=E(G)的所有连通图G,最后还提出了一个关于γs′t(G)上界的猜想。
3) total signed domination function
全符号控制函数
1.
The total signed domination function and total signed domination number of graphs are defined,and some results of total signed domination number of some special graphs are obtained.
定义了图的全符号控制函数及其全符号控制数 ,并得到了若干图的全符号控制数的
4) signed total domination number
符号全控制数
1.
The signed total domination number of a graph G,denoted by γ■■(G),is the minimum weight of a signed total dominating function on G.
图的符号全控制数记作"ts(G),是G的符号全控制数的最小权重。
2.
(2) Determine the signed total domination numbers for some special graphs such as complete graphs,stars,fans,wheels,complete multi-part graphs,etc.
(2)对几类特殊图的符号全控制数进行讨论,得到了完全图,星图,扇图,轮图,以及完全多部图的符号全控制数。
5) signed total domination function
符号全控制函数
6) Signed edge total domination function
符号边全控制函数
补充资料：符号逻辑(见数理逻辑)
符号逻辑(见数理逻辑)
symbotic logic
tun叩Iuo”_符号逻辑(s，mb。牡clog玩)见数理逻择。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条