摘要
对于图G=(V(G),E(G)),图G的Pk-因子H是G的一个生成子图,若H的每个连通分支都是一条恰含k个顶点的路,其中k≥2。图G的线图L(G)是一个以E(G)为顶点集的图,L(G)中两个顶点相邻当且仅当对应边在图G中有一个公共顶点。本文提出了寻找树T的线图L(T)中P_(4)-因子的一个算法。
For a graph G=(V(G),E(G)),a Pk-factor H of G is a spanning subgraph of G such that each component of H is a path of k vertices,where k≥2.The line graph of G is a graph L(G)with vertex set E(G),two vertices are adjacent in L(G)if the corresponding edges in G have a common end.We propose an algorithm to search for the P_(4)-factor in the line graph of a tree.
作者
樊驰
陈园
FAN Chi;CHEN Yuan(School of Mathematics and Statistics,Wuhan Textile University,Wuhan Hubei 430200,China)
出处
《武汉纺织大学学报》
2025年第6期33-36,共4页
Journal of Wuhan Textile University
基金
国家自然科学基金(NSFC 12201472)。
关键词
树
线图
路因子
tree
line graphs
path factor
