Kernels in circulant digraphs
A kernel $J$ of a digraph $D$ is an independent set of vertices of $D$ such that for every vertex $w,in,V(D),setminus,J$ there exists an arc from $w$ to a vertex in $J.$ In this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. This charact...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
University of Isfahan
2014-06-01
|
| Серія: | Transactions on Combinatorics |
| Предмети: | |
| Онлайн доступ: | http://www.combinatorics.ir/pdf_4777_9925aa9b3c368bb5a7b3527a835e19f9.html |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|