On k-cost effective domination in the corona and lexicographic product of graphs and its variant

DOI10.1142/S1793830922501166MaRDI QIDQ6132872zbMATH OpenOpenAlexFDO

Authors R. N. Paluga, Gina Malacas

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922501166

zbMATH Keywords

coronalexicographic product\(k\)-cost effective domination\(k\)-cost effective domination index\(k\)-cost effective setmaximal cost effective domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Cost effective domination in the join, corona and composition of graphs
• Another look at \(k\)-domination in graphs
• \([1,k]\)-domination number of lexicographic products of graphs
• Domination in lexicographic product graphs.
• Domination in the corona and join of graphs

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3477211 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Client-server and cost effective sets in graphs
• Cost effective domination in graphs
• Cost effective domination in the join, corona and composition of graphs
• Forcing domination numbers of graphs under some binary operations
• Total domination in graphs
• Towards a theory of domination in graphs
• Very cost effective bipartitions in graphs

Cited in

(2)

• Cost effective domination in the join, corona and composition of graphs
• Bounds on cost effective domination numbers

This page was built for publication: On k-cost effective domination in the corona and lexicographic product of graphs and its variant

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