| 连通度为k的图的L(2,1)-标号 |
| |
| 引用本文： | 吕大梅,林文松,宋增民.连通度为k的图的L(2,1)-标号[J].吉林大学学报(理学版),2007,45(4):555-561. |
| |
| 作者姓名： | 吕大梅 林文松 宋增民 |
| |
| 作者单位： | 1. 南通大学 理学院, 江苏省 南通 226007; 2. 东南大学 数学系, 南京 210096 |
| |
| 基金项目： | 国家自然科学基金
,
东南大学校科研和教改项目 |
| |
| 摘 要： | 通过找出图G的补图Gc的路覆盖数与其子图G-S的各个连通分支补图的路覆盖数间的关系, 在图G的λ数与其补图Gc的路覆盖数之间关系的基础上, 给出图G的λ数与子图G-S的各个连通分支补图的路覆盖数之间的关系（这里S是G的一个k顶点割).
|
| 关 键 词： | L(2 1)-标号 路覆盖数 连通度 |
| 文章编号： | 1671-5489（2007）04-0555-07 |
| 收稿时间： | 2006-09-18 |
| 修稿时间： | 2006-09-18 |
L(2,1)-Labelings of Graphs with Connectivity k |
| |
| L Da-mei,LIN Wen-song,SONG Zeng-min.L(2,1)-Labelings of Graphs with Connectivity k[J].Journal of Jilin University: Sci Ed,2007,45(4):555-561. |
| |
| Authors: | L Da-mei LIN Wen-song SONG Zeng-min |
| |
| Institution: | 1. College of Science, Nantong University, Nantong 226007, Jiangsu Province, China;2. Department of Mathematics, Southeast University, Nanjing 210096, China |
| |
| Abstract: | We firstly gave the relationship between the path covering number of the complement Gcof 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 λ number of graph Gwith connectivity kand the path covering number of the complement graphs of the connect components of G-S via the relationship between the λnumber of graph Gand the path covering number of its complement Gcwhere Sis a k vertexcut ofG ). |
| |
| Keywords: | L(2 1)-labelings path covering number connec tivity |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
