Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: (k

Sortuj według:

Ogranicz wyniki do:

On the Existence of (k,l)-Kernels in Infinite Digraphs: A Survey

100%

Galeana-Sánchez H., Hernández-Cruz C.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 3

431-466

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N, u 6= v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k −1)-kernel. This work is a survey of results proving sufficient conditions for the existence of (k, l)-kernels in infinite digraphs. Despite all the previous work in this direction was done for (2, 1)-kernels, we present many original results concerning (k, l)-kernels for distinct values of k and l. The original results are sufficient conditions for the existence of (k, l)- kernels in diverse families of infinite digraphs. Among the families that we study are: transitive digraphs, quasi-transitive digraphs, right/left pretransitive digraphs, cyclically k-partite digraphs, κ-strong digraphs, k-transitive digraphs, k-quasi-transitive digraphs

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Galeana-Sánchez H.

1 Hernández-Cruz C.

1 2014

Wyniki wyszukiwania

On the Existence of (k,l)-Kernels in Infinite Digraphs: A Survey