On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
From MaRDI portal
Publication:942091
DOI10.1016/j.disc.2007.08.078zbMath1169.05039MaRDI QIDQ942091
Iwona Włoch, Waldemar Szumny, Andrezej Włoch
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.078
05C30: Enumeration in graph theory
05C75: Structural characterization of families of graphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs, \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs, Generalized sequences and \(k\)-independent sets in graphs, On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
Cites Work