1) reverse signed edge total domination number
反符号边全控制数
1.
A function f:E→{+1,-1}is said to be a reverse signed edge total dominating function(RSETDF) of G if ∑f(e′)≤0 holds for every edge e∈E(G),where e′∈N(e)and γ′st(G)=max∑f(e)|f is a RSETDF of G,e∈Eis called the reverse signed edge total domination number of G.
而γs′t(G)=max∑f(e)|f为G的反符号边全控制函数,e∈E(G)称为图G的反符号边全控制数。
2) reverse signed edge total dominating function
反符号边全控制函数
1.
A function f:E→{+1,-1}is said to be a reverse signed edge total dominating function(RSETDF) of G if ∑f(e′)≤0 holds for every edge e∈E(G),where e′∈N(e)and γ′st(G)=max∑f(e)|f is a RSETDF of G,e∈Eis called the reverse signed edge total domination number of G.
设G=(V,E)是一个图,N(e)表示G中与e相邻的边集,函数f:E→{+1,-1},如果对任意e∈E(G)均有∑f(e′)≤0,其中e′∈N(e),则称f为图G的一个反符号边全控制函数。
3) 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)上界的猜想。
4) reverse signed edge domination number
反符号边控制数
5) Signed edge total domination function
符号边全控制函数
6) reverse signed edge dominating function
反符号边控制函数
补充资料：符号逻辑(见数理逻辑)
符号逻辑(见数理逻辑)
symbotic logic
tun叩Iuo”_符号逻辑(s，mb。牡clog玩)见数理逻择。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条