Total [1,k]-sets of lexicographic product graphs with characterization

zbMATH Open1465.05151MaRDI QIDQ4990787FDOQ4990787

Author name not available (Why is that?)

Publication date: 31 May 2021

Full work available at URL: https://www.ijmex.com/index.php/ijmex/article/view/799

Recommendations

• \([1,k]\)-domination number of lexicographic products of graphs
• A note on graphs with largest total \(k\)-domination number.
• Secure dominating sets in the lexicographic product of graphs
• Total $k$-domination in strong product graphs
• Total \(k\)-domination in Cartesian product graphs

zbMATH Keywords

dominationtotal dominationlexicographic products\([1, k\)-set]independent \([1, k\)-set]total \([1, k\)-set]

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Total \([1,k]\)-sets of lexicographic product graphs with characterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990787)