| 双色双向圈的本原指数 |
| |
| 引用本文： | 高玉斌,邵燕灵.双色双向圈的本原指数[J].黑龙江大学自然科学学报,2004,21(4):55-58. |
| |
| 作者姓名： | 高玉斌 邵燕灵 |
| |
| 作者单位： | 中北大学,数学系,山西,太原,030051;中北大学,数学系,山西,太原,030051 |
| |
| 基金项目： | Supported by Shanxi Natural Science Foundation (20041010) |
| |
| 摘 要： | 称一个双色有向圈D是本原的,若存在非负整数h,k满足h + k > 0,使得对于每一对顶点(i,j),在D中都存在从i到j的(h,k)途径.D的本原指数是满足上述条件的最小的值h + k.研究双色双向圈的本原指数,给出了一个紧的上界.
|
| 关 键 词： | 本原指数 双色有向图 途径 |
Exponents of two-colored double directed cycles |
| |
| GAO Yu-bin,SHAO Yan-ling.Exponents of two-colored double directed cycles[J].Journal of Natural Science of Heilongjiang University,2004,21(4):55-58. |
| |
| Authors: | GAO Yu-bin SHAO Yan-ling |
| |
| Abstract: | A two-colored directed graph D is primitive if there exist nonnegative integers h and k with h + k > 0 such that for each pair (i,j) of vertices there exists an (h,k)-walk in D from i to j. The exponent of D is the smallest value of h + k over all such h and k. The tight upper bound on the exponents of two-colored double directed cycles is given. |
| |
| Keywords: | Exponent two-colored directed graph walk |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
