4-立方中匹配扩张成支撑2-路  

Matchings extend to spanning 2-paths in 4-cube

作　　者：王淑贾 王凡[1] WANG Shujia;WANG Fan(School of Mathematics and Computer Sciences,Nanchang University,Nanchang 330031,China)

机构地区：[1]南昌大学数学与计算机学院,江西南昌330031

出　　处：《南昌大学学报（理科版）》2024年第4期307-313,共7页Journal of Nanchang University(Natural Science)

基　　金：国家自然科学基金资助项目(12061047);江西省自然科学基金(20212BAB201027,20192BAB211002)。

摘　　要：图G的一个支撑子图称为G的一个支撑k-路,如果此支撑子图的分支是k条点不交的路。在运用归纳法构造超立方的哈密尔顿圈时,支撑k-路起着至关重要的作用。研究超立方的支撑k-路得到了以下结论:设u,v,x,y是Q_(4)中四个不同点满足p(u)=p(v)≠p(x)=p(y),M是Q_(4)-{u,v,x,y}的任意一个匹配,则Q_(4)中存在一个支撑2-路P_(u,x)+P_(v,y)经过匹配M。A spanning subgraph of G whose components are k disjoint paths is a spanning k-path of G.When applying inductive methods to construct a Hamiltonian cycle in a hypercube,the spanning k-path palys a crucial role.In this paper,we obtainned the following result.Let u,v,x,y be pairwise distinct vertices in Q_(4)with p(u)=p(v)≠p(x)=p(y).If M was a matching in Q_(4)-{u,v,x,y},then there exists a spanning 2-path P_(u,x)+P_(v,y),y of Q_(4)passing through M.

关 键 词：超立方 哈密尔顿圈 支撑2-路 匹配 

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