Signed total domatic number of a graph

Let G = （V, E） be a graph, and let f ： V →{-1, 1} be a two-valued function. If ∑x∈N（v） f（x） ≥ 1 for each v ∈ V, where N（v） is the open neighborhood of v, then f is a signed total dominating function on G. A set {fl, f2,… fd} of signed d total dominating functions on G with the property that ∑i=1^d fi（x） ≤ 1 for each x ∈ V, is called a signed total dominating family （of functions） on G. The maximum number of functions in a signed total dominating family on G is the signed total domatic number on G, denoted by dt^s（G）. The properties of the signed total domatic number dt^s（G） are studied in this paper. In particular, we give the sharp bounds of the signed total domatic number of regular graphs, complete bipartite graphs and complete graphs.

The Signed Domination Number of Cartesian Product of Two Paths

Let G be a finite connected simple graph with vertex set V(G) and edge set E(G). A function f:V(G) → {1,1} is a signed dominating function if for every vertex v∈V(G), the closed neighborhood of v contains more vertices with function values 1 than with −1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate The signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 3, 4, 5 and arbitrary n.

On the Signed Domination Number of the Cartesian Product of Two Directed Cycles

Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function ?is called a signed dominating function (SDF) if ?for each vertex . The weight ?of f is defined by . The signed domination number of a digraph D is . Let Cm × Cn denotes the cartesian product of directed cycles of length m and n. In this paper, we determine the exact values of gs(Cm × Cn) for m = 8, 9, 10 and arbitrary n. Also, we give the exact value of gs(Cm × Cn) when m, ?(mod 3) and bounds for otherwise.

The Generalization of Signed Domination Number of Two Classes of Graphs

Let be a graph. A function is said to be a Signed Dominating Function (SDF) if holds for all . The signed domination number . In this paper, we determine the exact value of the Signed Domination Number of graphs and for , which is generalized the known results, respectively, where and are denotes the k-th power graphs of cycle and path .

Signed Total Domination in Graphs

Let G=(V,E) be a simple graph. For any real valued function f:V →R, the weight of f is f(V) = ∑f(v) over all vertices v∈V . A signed total dominating function is a function f:V→{-1,1} such that f(N(v)) ≥1 for every vertex v∈V . The signed total domination number of a graph G equals the minimum weight of a signed total dominating function on G . In this paper, some properties of the signed total domination number of a graph G are discussed.

On optimal binary signed digit representations of integers

Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is and how to generate them entirely. We also show which kinds of integers have the maximum number of optimal BSD-Rs.

Signed (b,k)-Edge Covers in Graphs

Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , where . The value , taking over all signed -edge covers of is called the signed -edge cover number of and denoted by . In this paper we give some bounds on the signed -edge cover number of graphs.

On Signed Domination of Grid Graph

Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : V(G)→{−1,1} if for every vertex v ∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 6, 7 and arbitrary n.

P_(m)×P_(n)的符号边控制数

本文研究了路与路的笛卡尔乘积图P_(m)×P_(n)的符号边控制的问题.利用构造和数学归纳的方法,获得了P_(m)×P_(n)(m=2,3,4)的符号边控制数.

基于NTRUSign的匿名代理签名方案

提出一个基于NTRUSign的匿名代理签名方案,并对该方案进行了详细的安全性分析。结果表明该方案满足一个匿名代理签名方案应具有的性质,且实现速度快、占用资源少以及产生密钥容易,具有更高的实用性和安全性。

广义b-基超立方体网络的符号全控制数

该文研究了广义b-基超立方体网络GC_(n)(b)的符号全控制数γst(GC_(n)(b))的问题.首先给出了当n=2k+1,b=3时,网络GC_(n)(b)的符号全控制数的上下界,然后利用数学归纳递推和反证法,确定了当b=3,n=1,2,3时,网络GC_(n)(b)符号全控制数的精确值.

超多车道出口指路标志前置距离模型研究

超多车道高速公路出口指路标志前置距离的研究可以为道路管理者和设计者提供参考,并提高超多车道高速公路的安全性和运行效率。文章以车辆驶出的运动过程特性为基础,构建了以车道数为参数的高速公路出口指路标志前置距离理论模型,并标定了模型的参数;对比分析了不同主线限速、指路标志设置方式和匝道限速条件下不同车道数的高速公路出口指路标志前置距离。结果表明:在相同条件下,高速公路龙门架式出口指路标志的前置距离不应小于路边直立式的;当高速公路出口指路标志为路边直立式时,双向十车道标志前置距离为2.7、1.7和1.2 km,而双向十二车道标志前置距离则为2.9、1.9和1.4 km;当高速公路出口指路标志为龙门架式时,双向十车道标志前置距离为2.8、1.8和1.3 km,而双向十二车道标志前置距离则为3.0、2.0和1.5 km。

Lower Bounds on the Majority Domination Number of Graphs

Let G=(V,E) be a simple graph. For any real valued function f∶V→R and SV, let f(S)=∑ u∈S?f(u). A majority dominating function is a function f∶V→{-1,1} such that f(N)≥1 for at least half the vertices v∈V. Then majority domination number of a graph G is γ maj(G)=min{f(V)|f is a majority dominating function on G}. We obtain lower bounds on this parameter and generalize some results of Henning.

基于CORDIC旋转器的基-3 FFT算法高效设计

设计出一种可以用于FPGA高效实现的基-3 FFT算法,采用改进的三端前馈延迟转换器结构,优化了延迟和运算过程。针对蝶形运算中复数乘法器占据大量内存的问题,引入了CORDIC旋转器实现输入与旋转因子相乘的运算,可以降低乘法运算的复杂度,该CORDIC旋转器采用改进的高基CORDIC算法,解决了传统的CORDIC算法迭代次数多、延迟大的问题,从而达到高吞吐率要求。该基-3 FFT算法以寻址变序、流水处理的方式,可以满足最高运行频率为404 MHz的FFT处理要求。与基于传统复数乘法器的基-3 FFT算法相比,基于CORDIC旋转器的基-3 FFT算法使功耗平均减少了22%,使总延迟平均减少了29%。

A lower bound on the total signed domination numbers of graphs

Let G be a finite connected simple graph with a vertex set V (G) and an edge set E(G). A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1}. The weight of f is w(f) = Σ x∈V(G)∪E(G) f(x). For an element x ∈ V (G) ∪ E(G), we define $f[x] = \sum\nolimits_{y \in N_T [x]} {f(y)} $ . A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1} such that f[x] ? 1 for all x ∈ V (G) ∪ E(G). The total signed domination number γ s * (G) of G is the minimum weight of a total signed domination function on G.In this paper, we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values of γ s * (G) when G is C n and P n .

On Signed Edge Total Domination Numbers of Graphs

Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination number γ st （G） of G is defined as γ st （G） = min{ e∈E（G） f（e）｜f is an SETDF of G}.In this paper we obtain some new lower bounds of γ st （G）.

On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number

Let G = （V, E） be a simple graph. A function f ： E → {＋1,-1} is called a signed cycle domination function （SCDF） of G if ∑e∈E（C） f（e） ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ′sc（G） = min{∑e∈E f（e）｜ f is an SCDF of G}. This paper will characterize all maxima] planar graphs G with order n ≥ 6 and γ′sc（G） =n.