 首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 完全免费 4篇
 数学 4篇
 2023年 1篇 2017年 2篇 2015年 1篇

1
1.
The study of optical orthogonal codes has been motivated by an application in an optical code‐division multiple access system. From a practical point of view, compared to one‐dimensional optical orthogonal codes, two‐dimensional optical orthogonal codes tend to require smaller code length. On the other hand, in some circumstances only with good cross‐correlation one can deal with both synchronization and user identification. These motivate the study of two‐dimensional optical orthogonal codes with better cross‐correlation than auto‐correlation. This paper focuses on optimal two‐dimensional optical orthogonal codes with the auto‐correlation and the best cross‐correlation 1. By examining the structures of w‐cyclic group divisible designs and semi‐cyclic incomplete holey group divisible designs, we present new combinatorial constructions for two‐dimensional ‐optical orthogonal codes. When and , the exact number of codewords of an optimal two‐dimensional ‐optical orthogonal code is determined for any positive integers n and .  相似文献
2.
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D.In the present paper,by using a labeling method,we provide an O(m) time algorithm to solve the2-step domination problem on block graphs,a superclass of trees.  相似文献
3.
Let G =(V, E) be a simple graph with vertex set V and edge set E. A signed mixed dominating function of G is a function f:V∪E→ {-1, 1} such that ∑_(y∈N_m(x)∪{x})f(y)≥ 1for every element x∈V∪E, where N_m(x) is the set of elements of V∪E adjacent or incident to x. The weight of f is w(f) =∑_(x∈V∪E)f(x). The signed mixed domination problem is to find a minimum-weight signed mixed dominating function of a graph. In this paper we study the computational complexity of signed mixed domination problem. We prove that the signed mixed domination problem is NP-complete for bipartite graphs, chordal graphs, even for planar bipartite graphs.  相似文献
4.
$f: E(G)\rightarrow\{-1,1\}$称为图$G =(V,E)$的一个符号边控制函数 (简称SEDF),如果$f[e]=f(N[e])=\sum_{e''\in N[e]}f(e'')\geq1$对于图$G$的每条边$e\in E$都成立. $w(f)=\sum_{e\in E}f(e)$称为函数$f$的权. $G$的符号边控制数$\gamma_{s}\,''(G)$是指$G$的所有符号边控制函数的最小权.本文对完全多部图的符号边控制数进行研究.对于完全$r$-部图, 当$r$为偶数并且各部的顶点数相同的情况下,我们得到了这一参数的若干下界和上界.  相似文献
1