[1, k]-Domination Number of Lexicographic Products of Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-020-00957-0
Abstract: A subset D of the vertex set V ( G ) of a graph G is called a [1, k ]-dominating set if every vertex from $$V-D$$ V - D is adjacent to at least… read more here.
Keywords: domination number; number lexicographic; number; products graphs ... See more keywords