| 强乘积图的连通度 |
| |
| 引用本文： | 孙犁,徐俊明.强乘积图的连通度[J].中国科学技术大学学报,2006,36(3):241-243,248. |
| |
| 作者姓名： | 孙犁 徐俊明 |
| |
| 作者单位： | 中国科学技术大学数学系,安徽,合肥,230026 |
| |
| 基金项目： | Supported by NNSF of China （ 10271114）. |
| |
| 摘 要： | 用k1＞0和δi表示图Gi(i=1,2)的连通度和最小度,给出了无向图强乘积的连通度一个下界κ(G1(□×)G2)≥min{κ1(1+δ2),k2(1+δ1)}.
|
| 关 键 词： | 图 连通度 强乘积图 最小度 |
| 文章编号： | 0253-2778（2006）03-0241-03 |
| 收稿时间： | 2004-12-09 |
| 修稿时间： | 2004-12-092005-10-17 |
Connectivity of strong product graphs |
| |
| SUN Li,XU Jun-ming.Connectivity of strong product graphs[J].Journal of University of Science and Technology of China,2006,36(3):241-243,248. |
| |
| Authors: | SUN Li XU Jun-ming |
| |
| Abstract: | The symbols κi, δi are used to denote the connectivity and the minimum degree of a graph Gi for i = 1,2. κ(G1(□×)G2 ) ≥ min{κ1 (1 + δ2 ) ,κ2 (1 + δ1 ) } is established if G1 and G2 are connected undirected graphs, where G1(□×)G2 is the strong product of G1 and G2. |
| |
| Keywords: | graph connectivity strong product graphs minimum degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
