| 有向线图中的(k,l)-核 |
| |
| 引用本文： | 鲁勤,单而芳,赵敏.有向线图中的(k,l)-核[J].上海大学学报(英文版),2006,10(6):484-486. |
| |
| 作者姓名： | 鲁勤 单而芳 赵敏 |
| |
| 作者单位： | Department of Mathematics College of Sciences Shanghai University，Department of Mathematics College of Sciences Shanghai University，Department of Mathematics College of Sciences Shanghai University，Shanghai 200444 P.R. China Shanghai 200444 P.R. China Shanghai 200444 P.R. China |
| |
| 摘 要： | 1 Introduction We consider the finite digraphs that do not havemultiple arcs or loops , but pairs of opposite arcs areallowed.LetD=(V,A) be a digraph , whereVisthe set of vertices andAis the set of arcs .If there isan arc (x,y) fromxtoy,thenthe vertexxis …
|
| 关 键 词： | 线有向图 （ k l ） -核 κ-核 ι-核 |
| 文章编号： | 1007-6417（2006）06-0484-03 |
| 收稿时间： | 2005-03-02 |
| 修稿时间： | 2005-04-18 |
(k,l)-kernels in line digraphs |
| |
| Qin Lu,Er-fang Shan Ph. D.,Min Zhao.(k,l)-kernels in line digraphs[J].Journal of Shanghai University(English Edition),2006,10(6):484-486. |
| |
| Authors: | Qin Lu Er-fang Shan Ph D Min Zhao |
| |
| Institution: | Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P.R. China |
| |
| Abstract: | Let D=(V,A) be a digraph with minimum indegree at least one and girth at least k, where k⩾2 is an integer. In this paper , the following results were proved. A digraph D has a (k,l)-kernel if and only if its line digraph L(D) does, and the number of (k,l)-kernels in D is equal to the number of (k,l)-kernels in L(D), where 1⩽l<k. As a consequence, previous results about k-kernels in the line digraphs were gained.
Project supported by National Natural Science Foundation of China(Grant No. 10571117) |
| |
| Keywords: | kernel k-kernel (k l)-kernel |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
