5元n立方体中指定三条点不交覆盖路  

Specifying Three Disjoint Paths Covers in 5-ary n Cube

作　　者：佘卫强[1] SHE Wei-qiang(College of General Education,Zhangzhou Institute of Technology,Zhangzhou 363000,China)

机构地区：[1]漳州职业技术学院通识教育学院,福建漳州363000

出　　处：《长春师范大学学报》2023年第6期1-5,共5页Journal of Changchun Normal University

基　　金：国家自然科学基金项目“Lagrange网络实用同步的不连续控制研究”(61603174);福建省自然科学基金项目“机械臂网络任务空间同步的不连续控制”(2020J01793)。

摘　　要：k元n立方体被视为将来候选网络结构之一,它有很多优良性质和参数,被用作度量路由选择,能直接影响网络通信的稳定性和传输时效.本文研究了5元n立方体中一对三条点不交覆盖路问题,运用数学归纳法可得,当n≥2时,在Q_(n)^(5)中任意取四个顶点x,y_(1),y_(2),y_(3),则在Q_(n)^(5)中存在三条内部顶点不交的覆盖路P1=(x,…,y_(1)),P2=(x,…,y_(2)),P3=(x,…,y_(3)).k-ary n cube is regarded as one of the candidate network structures in the future.It has many excellent properties and parameters,which can be used to measure routing,and can directly affect the stability and transmission efficiency of network communication.In this paper,the problem of one to three disjoint coverage paths in 5-ary n cube.The following results are obtained by using mathematical induction:let Q_(n)^(5) be the 5-ary n cube,where n≥2,assume that x,y 1,y_(2),y_(3)be pairwise distinct vertices of Q_(n)^(5).Then Q_(n)^(5) can be found three vertex-disjoint covering paths P 1=(x,…,y_(1)),P 2=(x,…,y_(2)),P 3=(x,…,y_(3)).

关 键 词：5元n立方体 点不交路 覆盖 拓扑网络 

分 类 号：O157.6[理学—数学]