Star网络S_5的Hamilton圈分解

最近Star网络和Pancake网络作为超立方体(并行计算机中多处理机互连的一种著名拓扑结构)的替代品而被许多作者研究.这两种网络的一个好的特点是:与超立方体相比较,它们有较小的直径和顶点度.尤其Star网络,更是受到研究人员的极大关注.在本文中:(a)我们提出了一种在这两种网络中找Hamilton圈的新方法.(b)证明了关于Star网络S_n的一个猜想在n=5时是正确的,即给出了S_5的两个边不交的Hamilton圈,且S_5是这两个Hamilton圈的并.     

折叠交叉立方体的分支边连通度

r-分支连通度(边连通度)是衡量大型互连网络可靠性和容错性的一个重要参数.设G是连通图且r是非负整数,如果G中存在某种点子集(边子集)使得G删除这种点子集(边子集)后得到的图至少有r个连通分支.则所有这种点子集(边子集)中基数最小的点子集(边子集)的基数称为图G的r-分支连通度(边连通度).n-维折叠交叉立方体FCQn是由交叉立方体CQn增加2n-1条边后所得.该文利用r-分支边连通度作为可靠性的重要度量,对折叠交叉立方体网络的可靠性进行分析,得到了折叠交叉立方体网络的2-分支边连通度,3-分支边连通度,4分支边连通度.确定了折叠交叉立方体FCQn的r-分支边连通度.     

关于Mbius立方体网格的连通度(英文)

图的连通度、超连通性和限制连通度是度量互连网络容错性的重要参数 .该文考虑n维M bius立方体网络MQn,证明了它的点和边连通度都为n ,当n是任何正整数时它是超连通的 ,当n≠ 2时它是超边连通的 ,当n≥ 3时它的限制点连通度和当n≥ 2时的限制边连通度都为 2n- 2 .     

平衡立方体的h-额外连通度及h-额外条件诊断数

互连网络的连通度和可诊断数是衡量网络性能优劣的经典参数.h-额外连通度作为连通度的一种推广,是度量互连网络可靠性的一个重要指标.相应地,h-额外条件诊断数作为传统可诊断度的推广,也是度量系统诊断能力的一种新的性能指标.另外,平衡立方体网络作为超立方体网络的变形,在保留前者原有优良性能的基础上,又增加了一些新的优良性能.文中确定了平衡立方体(BH_n)的4-额外连通度和5-额外连通度都是6n-8.在此基础上,进一步推导出当h=4,5,n≥4时,BH_n在PMC模型下的h-额外条件可诊断数是6n-3.从而表明了在h-额外条件诊断策略下的可诊断数几乎是传统可诊断数的3倍.     

关于轮网络的一簇猜想

轮网络是由Cayley图模型设计出来的一种新型互连网络模型.星网络、冒泡排序网络、修正冒泡排序网络可嵌入轮网络.为了揭示它的整体结构,对轮网络提出如下一簇猜想:轮网络是边不交的i个Hamilton圈及2(n-i)-2个完美匹配的并,其中1≤i≤(n-1);并证明了当n=4,5,6,1≤i≤3时,猜想成立.     

关于超立方体网络的(d,k)独立数

(d,k)独立数是分析互连网络性能的一个重要参数.对于任意给定的图G和正整数d和k,确定G的(d,k)独立数问题是一个NPC问题.因此,确定一些特殊图的(d,k)独立数显得很重要.本文确定了k维超立方体网络的(d,k)独立数等于2,如果d=k≥4或者d=k-1≥6 以及αd,k-t(Qk)=αd,k(Qk),其中0≤t≤k-2,1≤d≤k-t-1.     

完全对换网络的限制连通度

完全对换网络是基于 Cayley 图模型的一类重要互连网络. 一个图 G 的 k-限制点(边)连通度是使得 G-F 不连通且每个分支至少有 k 个顶点的最小点(边)子集 F 的基数, 记作 \kappa_{k}(\lambda_{k}). 它是衡量网络可靠性的重要参数之一, 也是图的容错性的一种精化了的度量. 一般地, 网络的 k-限制点(边)连通度越大, 它的连通性就越好. 证明了完全对换网络 CT_{n} 的 2-限制点(边)连通度和 3-限制点(边)连通度, 具体来说: 当 n\geq4 时, \kappa_{2}(CT_{n})=n(n-1)-2, \kappa_{3}(CT_{n})=\frac{3n(n-1)}{2}-6; 当 n\geq3 时, \lambda_{2}(CT_{n})=n(n-1)-2, \lambda_{3}(CT_{n})=\frac{3n(n-1)}{2}-4.     

图的超级限制边连通性

在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连通的.因此,它们比de Bruijn网络有更好的限制边连通性.     

结构VAR的有向非循环图模型

研究用图模型方法辨识结构向量自回归(VAR)模型,图中的结点表示不同时刻的随机变量,结点间的边表示其所表示的随机变量之间存在的因果相依关系.针对建立有向非循环图的问题,提出了一种基于回归分析的判断方法,用回归方程的回归平方和之差作为统计量,确定当前变量之间相依关系的方向.与R ea le的逐一判别法和A lessio的图搜索方法相比,文中提出的基于统计分析的方法简单易行,且可获得唯一的当前变量有向非循环图.最后以两组模拟序列为例,验证了所提出的方法是可行且有效的.     

基于网络舆情支持向量机的股票价格预测研究

提出一种基于网络舆情和股票技术指标数据的支持向量机回归模型(NPOSVM),提高了股票价格的预测精度.模型首先将抓取的微博、股吧等股评观点分为正面和负面两类,计算正面观点所占的比例作为网络舆情,然后对网络舆情和股票技术指标数据作主成分分析,最后对保留的主成分运用支持向量机回归建模预测.实证分析国药股份(SH600511),仿真结果表明网络舆情与股票价格之间的相关系数为0.76;基于股票技术指标数据的支持向量机回归模型(TI-SVM)预测平均相对误差为1.29%、趋势准确率为57.14%,而NPO-SVM预测平均相对误差为0.66%、趋势准确率为71.43%.于是证明,NPO-SVM模型显著地提高了预测精度,是一种有效的预测股票价格的模型.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

p~2阶弧传递循环图的正规性条件

群G关于S的有向Cayley图X=Cay(G,S)称为pk阶有向循环图,若G是pk阶循环群.利用有限群论和图论的较深刻的结果,对p2阶弧传递(有向)循环图的正规性条件进行了讨论,证明了任一p2阶弧传递(有向)循环图是正规的当且仅当(|Aut(G,S)|,p)=1.     

The construction of infinite families of any κ-tight optimal and singular κ-tight optimal directed double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is: for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained: (1) for any k ≥ 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k,e,c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k ≥ 0,an infinite family of singular k-tight optimal DLN can be constructed.     

On an extremal family of circulant networks

The paper addresses the optimization problem for circulant networks of maximizing the number of vertices given the degree and diameter of a graph. For the graphs in the best available extremal family of circulant networks, we improve the estimate for diameter, which together with previous results for multiplicative circulant networks enables us to improve the lower bounds for the attainable number of vertices of circulant networks of all dimensions k ≥ 4.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0, 1, ..., 40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number n _k (t, a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Gaussian integral circulant digraphs

The spectrum of a digraph in general contains real and complex eigenvalues. A digraph is called a Gaussian integral digraph if it has a Gaussian integral spectrum that is all eigenvalues are Gaussian integers. In this paper, we consider Gaussian integral digraphs among circulant digraphs.     

On the possible values of the entropy of undirected graphs

The entropy of a digraph is a fundamental measure that relates network coding, information theory, and fixed points of finite dynamical systems. In this article, we focus on the entropy of undirected graphs. We prove any bounded interval only contains finitely many possible values of the entropy of an undirected graph. We also determine all the possible values for the entropy of an undirected graph up to the value of four.     

Diameters of random circulant graphs

The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the worst connected networks are cycles whose diameters increase linearly in the number of nodes. In the present study we consider an intermediate class of examples: Cayley graphs of cyclic groups, also known as circulant graphs or multi-loop networks. We show that the diameter of a random circulant 2k-regular graph with n vertices scales as n ^1/k , and establish a limit theorem for the distribution of their diameters. We obtain analogous results for the distribution of the average distance and higher moments.     

On the Classification of Arc-transitive Circulant Digraphs of Order Odd-Prime-Squared

A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.     

On Hamiltonicity of circulant digraphs of outdegree three

This paper deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of the form {a,ka,c}, where k is an integer. In particular, we prove that if k=−1 or k=2 such a circulant digraph is Hamiltonian if and only if it is not isomorphic to the circulant digraph on 12 vertices with connection set {3,6,4}.