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

DOI10.1142/S1793830922501166zbMATH Open1516.05176OpenAlexW4281954156MaRDI QIDQ6132872FDOQ6132872

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

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

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)

Cites Work

• Title not available (Why is that?)
• Total domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Cost effective domination in graphs
• Very cost effective bipartitions in graphs
• Title not available (Why is that?)
• Client-server and cost effective sets in graphs
• Title not available (Why is that?)
• FORCING DOMINATION NUMBERS OF GRAPHS UNDER SOME BINARY OPERATIONS

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)