On the existence of (k, l)-kernels in digraphs with a given circumference
From the autors' abstract: 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\in N\), \(u \# v\), then \(d(u,v),d(v,u)\geq k\)) and \(l\)-absorbent (if \(u\in V(D)-N\) then there exists \(v\in N\) such that \(d(u,v)\leq l\)) set of vertices. A \(k\)-kernel is a \((k,k-1)\)-kernel. In a digraph \(D\) which has at least one directed cycle, the length of a longest directed cycle is called its circumference. We propose the following conjecture: If \(D\) is a digraph with circumference \(l\), then \(D\) has an \(l\)-kernel. This conjecture is proved for two families of digraphs and a partial result is obtained for a third family.
- On the existence of (k,\(\ell)\)-kernels in digraphs
- On the existence of \(k\)-kernels in digraphs and in weighted digraphs
- A sufficient condition for the existence of k-kernels in digraphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Kernels in circulant digraphs
- On \((k,l)\)-kernels in the Corona of digraphs
- On the kernel of integral circulant graphs
- On (k,l)-perfectnees of Special Classes of Digraphs
- On the existence of (k,k-1)-kernels in directed graphs
- Some sufficient conditions for the existence of kernels in infinite digraphs
- A note on the path Kernel conjecture
- On the existence of 3- and 4-kernels in digraphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- Domination in digraphs
- Some results on 4-transitive digraphs
- On the existence of independent \((1,k)\)-dominating sets for \(k\in\{1,2\}\) in two products of graphs
- On the existence of (k,\(\ell)\)-kernels in digraphs
This page was built for publication: On the existence of \((k, l)\)-kernels in digraphs with a given circumference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443409)
