# Search results

Discussiones Mathematicae Graph Theory > 2011 > 31 > 2 > 293-312

Discussiones Mathematicae Graph Theory > 2011 > 31 > 1 > 63-78

Discussiones Mathematicae Graph Theory > 2011 > 31 > 2 > 293-312

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 set of vertices (if u,v ∈ N, u ≠ 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). A k-kernel is a (k,k-1)-kernel. Quasi-transitive, right-pretransitive and left-pretransitive digraphs are generalizations of...

Discussiones Mathematicae Graph Theory > 2011 > 31 > 1 > 63-78

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 set of vertices (if u,v ∈ N then d(u,v) ≥ k) and l-absorbent (if u ∈ V(D)-N then there exists v ∈ N such that d(u,v) ≤ l). A k-kernel is a (k,k-1)-kernel. A digraph D is cyclically k-partite if there exists a partition of V(D) such that every arc...