On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
type: Item
instance of: scholarly article
title: On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
zbMATH Open document ID: 1169.05039
author: Waldemar Szumny
author: Iwona Włoch
author: Andrzej Włoch
published in: Discrete Mathematics
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5321335
zbMATH Keywords: counting
zbMATH Keywords: \((k, l)\)-kernel
zbMATH Keywords: efficient dominating set
zbMATH Keywords: lexicographic product
MaRDI profile type: Publication
full work available at URL: j.disc.2007.08.078
OpenAlex ID: W2094814356
cites work: Q3815323
cites work: Principles of combinatorics
cites work: Q4865131
cites work: Q4552189
cites work: Bounds on the number of vertex independent sets in a graph
cites work: Q3931424
cites work: A Note on Independent Sets in Trees
cites work: Q4869540
cites work: Q5466072
cites work: On \((k,l)\)-kernels in generalized products
cites work: Q5463582
DOI: 10.1016/J.DISC.2007.08.078
description: scientific article; zbMATH DE number 5321335