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

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

zbMATH Keywords

counting; efficient dominating set; lexicographic product; \((k, l)\)-kernel

Mathematics Subject Classification ID

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

The Fibonacci numbers of certain subgraphs of circulant graphs, On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs, \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs, A new generalization of kernels in digraphs, Generalized sequences and \(k\)-independent sets in graphs, Fibonacci numbers in graphs with strong (1, 1, 2)-kernels, On the Fibonacci numbers of the composition of graphs, On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs, About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs, On the existence of \((k,l)\)-kernels in infinite digraphs: a survey, Unnamed Item

Cites Work

• On \((k,l)\)-kernels in generalized products
• Bounds on the number of vertex independent sets in a graph
• Principles of combinatorics
• A Note on Independent Sets in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item