一类特殊的Kautz无向图的限制边连通度

限制边连通度是传统边连通度的推广,而且是计算机互连网络容错性的一个重要度量．该文考虑Kautz无向图UK(3,n)的限制边连通度λ’,得到如下结果：λ'(UK(3,1))=4,n≥2时,λ'(UK(3,n))=8.     

某型雷达反射板轻量化仿真设计

为满足某型雷达支架反射板的轻量化要求,使用碳纤维复合材料代替原有的1350铝合金材料.改进后的碳纤维材料反射板厚度由1.8 mm下降到1.4 mm,使结构重量减轻了50％.碳纤维材料相比于铝合金材料在强度刚度上都具有优势,但由于反射板厚度下降,无法判断其力学性能是否下降,需要进行理论计算及仿真论证.利用ANSYS软件对改进后的反射板进行模态分析、随机振动分析和瞬态动力学分析,并对其各阶固有频率进行了理论计算.结果 表明:2阶固有频率与2阶工作频率较为接近,应适当调整该阶工作频率,避免在固有频率附近工作.改进后的碳纤维反射板在振动载荷下安全系数提升9.473倍,冲击载荷下安全系数提升了3.269倍.研究结果为碳纤维材料替代传统金属材料提供了新的思路.     

扇图与轮图的边平均Wiener指标及其算法

文章证明了扇图Fn和轮图Wn的边平均Wiener指标,并给出扇图中任意两边之间的平均距离的算法程序.     

单圈图的k-距离匹配控制数

单圈图是边数等于顶点数的连通图.令G=(V,E)是无孤立顶点的图,若集合DV(G)是G的一个k-距离控制集且导出子图〈D〉有完美匹配,则称D是G的一个k-距离匹配控制集.k-距离匹配控制数γkp(G)是G的最小k-距离匹配控制集的势.主要证明了单圈图k-距离匹配控制数的一个重要引理,由此找到了单圈图k-距离匹配控制数的上界,并构造了极图.     

按Laplace谱半径对一些偶单圈图的排序

研究一些偶单圈图按其Laplace谱半径排序的问题.利用扩圈变换对偶单圈图S1k的Laplace谱半径影响的证明方法,得出了顶点数为k+2,圈长为k(k≥10)的偶单圈图C(k+2,k)按其Laplace谱半径从大到小的顺序依次排在前三位和最后一位的单圈图.     

Qos约束随机游走在移动自组网资源发现中的应用

针对目前移动自组网随机游走资源发现协议在请求转发过程中没有考虑Qos（Quality of Service）,使得选取的资源发现路径常常无法达到用户的要求,提出了将Qos约束条件应用到随机游走资源发现协议中,节点在随机转发请求分组时搜集邻居节点的剩余带宽、连接延迟和丢包率等信息,通过Qos计算公式计算出节点的Qos值,根据Qos值决定转发节点的选择或者丢弃,最终找到一条能够很好满足用户Qos需求的资源发现路径。     

On design of physical random access channel in high-speed railway LTE systems

For the uplink in the long-term evolution （LTE） systems, the physical random access channel （PRACH） adopts Zadoff-Chu （ZC） sequences as preamble sequences, and each user can choose a unique cyclic shift for user identification. In high-mobility scenario, the Doppler fre- quency shift raises up the false alarm probability by inducing the correlation peak offsetting at the receiver side. Traditional detection method utilizes multiple search win- dows for searching the potential uplink users. When the Doppler frequency shift is larger than the subcarrier spac- ing, the energy of correlation peak leaks outside the search window and increases the false alarm probability. In this paper, we present a novel design for PRACH preamble sequence for high-speed railway scenario. Through numerical observation, we find out that the offset of the correlation peaks only depends on the initial root sequence number and the length of ZC sequences. Therefore, the root number of ZC sequences should be carefully designed to generate a preamble sequence to fight against the Doppler frequency shift. Consequently, those offsets of the corre- lation peaks are concentrated within a single search win- dow, resulting in lower complexity of detection and lower probability of false alarm for random access in LTE uplink.     

不含3,4圈的平面图的无圈边染色的一个结果

利用差值转移方法研究了不含3圈,4圈的平面图的无圈边染色,证得了它们的无圈边色数不超过Δ(G)+2。     

图C~2_n的优美性

给出了图C2n的定义,并对其优美标号进行研究,得到了当n=4k(k≥2)时图C2n是优美图的结论。     

A new class of antimagic join graphs

A labeling/of a graph G is a bijection from its edge set E(G) to the set {1,2,…,|E(G)|},which is antimagic if for any distinct vertices x anAy,the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y.A graph G is antimagic if G has an f which is antimagic.Hartsfield and Ringel conjectured in 1990 that every connected graph other than K_2 is antimagic.In this paper,we show that if G_1 is an m-vertex graph with maximum degree at most 6r+l,and G_2 is an n-vertex(2r)-regular graph(m≥n≥3),then the join graph G_1 v G_2 is antimagic.