摘要
通过找出图G的补图Gc的路覆盖数与其子图G-S的各个连通分支补图的路覆盖数间的关系,在图G的λ数与其补图Gc的路覆盖数之间关系的基础上,给出图G的λ数与子图G-S的各个连通分支补图的路覆盖数之间的关系(这里S是G的一个k-顶点割).
We firstly gave the relationship between the path covering number of the complement G^c of G and the path covering number of the complement graphs of the connect components of G-S. And we then obtained the relationship between the A-number of graph G with connectivity k and the path covering number of the complement graphs of the connect components of G-S via the relationship between the A-number of graph G and the path covering number of its complement G^c （where S is a k-vertexcut of G）.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2007年第4期555-561,共7页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:10171013)
东南大学预研基金(批准号:XJ0607230)
关键词
L(2
1)-标号
路覆盖数
连通度
L（2,1 ） -labelings
path covering number
connectivity
