\([1,k]\)-domination number of lexicographic products of graphs
From MaRDI portal
Publication:2227955
DOI10.1007/s40840-020-00957-0zbMath1460.05144OpenAlexW3035174399MaRDI QIDQ2227955
Narges Ghareghani, Pouyeh Sharifani, Iztok Peterin
Publication date: 16 February 2021
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-020-00957-0
dominationlexicographic product\([1,k\)-domination]\([1,k\)-total domination]
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Geodesic transversal problem for join and lexicographic product of graphs ⋮ On \([j, k\)-sets in graphs]
Cites Work
- \((1, j)\)-set problem in graphs
- \([1,2\)-domination in graphs]
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms]
- When an optimal dominating set with given constraints exists
- \([1,2\)-sets in graphs]
- Open k-monopolies in graphs: complexity and related concepts
- Quasiperfect domination in triangular lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \([1,k]\)-domination number of lexicographic products of graphs
