On the existence and on the number of (k,l)-kernels in the lexicographic product of graphs
DOI10.1016/J.DISC.2007.08.078zbMATH Open1169.05039OpenAlexW2094814356MaRDI QIDQ942091FDOQ942091
Iwona Włoch, Andrzej Włoch, Waldemar Szumny
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles of combinatorics
- Bounds on the number of vertex independent sets in a graph
- A Note on Independent Sets in Trees
- On \((k,l)\)-kernels in generalized products
Cited In (11)
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
- The Fibonacci numbers of certain subgraphs of circulant graphs
- On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs
- Generalized sequences and \(k\)-independent sets in graphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- On the Fibonacci numbers of the composition of graphs
- A new generalization of kernels in digraphs
- Title not available (Why is that?)
This page was built for publication: On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942091)
