On \([j, k]\)-sets in graphs

DOI10.1007/s40840-022-01376-zzbMath1506.05164OpenAlexW4294740957MaRDI QIDQ2091155

Mohamed Zemir, Mustapha Chellali, Ahmed Bouchou

Publication date: 31 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01376-z

zbMATH Keywords

\([j, k\)-domination number]\([j, k\)-sets]

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• \((1, j)\)-set problem in graphs
• \([1,2\)-domination in graphs]
• The weighted perfect domination problem
• Weighted efficient domination problem on some perfect graphs
• \([1,k\)-domination number of lexicographic products of graphs]
• On the parameterized complexity of \([1,j\)-domination problems]
• \([1,2\)-sets in graphs]
• [1,2-Domination in generalized Petersen graphs]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \([j, k]\)-sets in graphs