| 线图连通度的界 |
| |
| 引用本文： | 何中市,杨晓帆.线图连通度的界[J].重庆大学学报(社会科学版),1995,1(5). |
| |
| 作者姓名： | 何中市 杨晓帆 |
| |
| 作者单位： | 重庆大学系统工程及应用数学系，计算机研究所，重庆大学系统工程及应用数学系，计算机研究所 重庆，630044，重庆，630044 |
| |
| 摘 要： | 首先给出了线图连通度κ_L的一个上界;κ_L≤δ+△-2;其次得出了在条件δ≥n/2]+1下κ_L的一个很好的下界;κ_L≥2δ-2;由此得到当δ≥n/2]+1时,若G为正则图,则κ_L=2δ-2,若G为拟正则图,则κ_L=2δ-2或2δ-1。
|
| 关 键 词： | 界 图连通性/线图 |
The Bounds for the Connectivity of Line Graphs |
| |
| He Zhongshi Yang Xiaofan.The Bounds for the Connectivity of Line Graphs[J].Journal of Chongqing University(Social Sciences Edition),1995,1(5). |
| |
| Authors: | He Zhongshi Yang Xiaofan |
| |
| Institution: | He Zhongshi Yang Xiaofan |
| |
| Abstract: | An upper bound and lower bounds for the connectivity of the line graph are determined. The upper bound is presented as -2 in general,and an advanced lower
bound is carried out in the form -2 when +1 Some other results are given,
especially,if + l,then KL = 2- 2 over the regular graph and over the quasi-regular graph. |
| |
| Keywords: | bound connectivity of graph / line graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《重庆大学学报(社会科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(社会科学版)》下载免费的PDF全文 |
