On the existence and on the number of (k,l)-kernels in the lexicographic product of graphs

DOI10.1016/J.DISC.2007.08.078MaRDI QIDQ942091zbMATH OpenOpenAlexFDO

Authors Waldemar Szumny, Iwona Włoch, Andrzej 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

zbMATH Keywords

countinglexicographic productefficient dominating set\((k, l)\)-kernel

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 2192204
• On \((k,l)\)-kernels in generalized products
• On \((k,l)\)-kernels in the Corona of digraphs
• On k-independent sets and (k,l)-kernels in the corona of graphs
• \([1,k]\)-domination number of lexicographic products of graphs

Cites work

• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 1792601 (Why is no real title available?)
• scientific article; zbMATH DE number 844146 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 2192204 (Why is no real title available?)
• scientific article; zbMATH DE number 2197929 (Why is no real title available?)
• A Note on Independent Sets in Trees
• Bounds on the number of vertex independent sets in a graph
• On \((k,l)\)-kernels in generalized products
• Principles of combinatorics

Cited in

(13)

• About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
• On k-independent sets and (k,l)-kernels in the corona of graphs
• k-kernels in k-transitive and k-quasi-transitive digraphs
• On (2-d)-kernels in the Cartesian product of graphs
• 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
• scientific article; zbMATH DE number 2192204 (Why is no real title available?)
• On the Fibonacci numbers of the composition of graphs
• A new generalization of kernels in digraphs

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)