| 循环圈的连通度 |
| |
| 引用本文： | 李唐芬.循环圈的连通度[J].数学研究及应用,1999,19(3):608-610. |
| |
| 作者姓名： | 李唐芬 |
| |
| 作者单位： | 国家科技部西南信息中心 |
| |
| 摘 要： | 设G＝Cn（i1，i2，…，ir）是连通循环圈，且k（G）＜δ（G）．本文得到了其连通度的明确表达式κ(G)=min{m|M(n/m,K)|:m是n的真因子，且|M(n/m,K)|
|
| 关 键 词： | 循环圈 连通度 原子部分 |
| 收稿时间： | 9/2/1996 12:00:00 AM |
| 修稿时间： | 1/5/1998 12:00:00 AM |
Connectivity of Circulant Graphs |
| |
| LI Tang-fen.Connectivity of Circulant Graphs[J].Journal of Mathematical Research with Applications,1999,19(3):608-610. |
| |
| Authors: | LI Tang-fen |
| |
| Institution: | Southwest information Centre; State Science and Technology Commission of China; Chongqing 400013 |
| |
| Abstract: | In this paper, an explicit expression is derived for the connectivity of a connected circulant graph whose connectivity is less than its point degree, that is k(G) = :m is a proper divisor of n and. |
| |
| Keywords: | circulant graph connectivity atomic part |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
