| 循环图的直积分解 |
| |
| 引用本文： | 黄琼湘,常安.循环图的直积分解[J].青海师范大学学报(自然科学版),1990(4):8-12. |
| |
| 作者姓名： | 黄琼湘 常安 |
| |
| 作者单位： | 新疆大学，青海师范大学 |
| |
| 摘 要： | 本文讨论了 Cayley 图的直积不变性,进而得到了一个循环图可分解为若干个循环图的积图的充要条件,并旦得到了两个正则有向图的连通度与它们的积图的连通度的关系。
|
| 关 键 词： | Cayley图 Cayley色图 循环图 直积 |
THE DIRECT PRODUCT DECOMPOSITION OF CIRCULANT GRAPH |
| |
| Huang Qungxiang.THE DIRECT PRODUCT DECOMPOSITION OF CIRCULANT GRAPH[J].Journal of Qinghai Normal University(Natural Science Edition),1990(4):8-12. |
| |
| Authors: | Huang Qungxiang |
| |
| Abstract: | In this paper,the invariant properties of direct product of Cayley graph have beenstudied.Furthermore,we have obtained a sufficient and necessary condition that acirculant graph can decompose into product graph of several circulant graphs.Therelation between the connectivity of two regular directed graphs with that of theirproduct graph has been discussed. |
| |
| Keywords: | Cayley graph Directed Cayley graph Circulant graph product graph Connectivity |
| 本文献已被 CNKI 维普 等数据库收录！ |
