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

DOI10.1142/s1793830922501166zbMath1516.05176OpenAlexW4281954156MaRDI QIDQ6132872

Rolando N. Paluga, Unnamed Author, 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)

Cites Work

• Very cost effective bipartitions in graphs
• Client-server and cost effective sets in graphs
• Total domination in graphs
• Towards a theory of domination in graphs
• FORCING DOMINATION NUMBERS OF GRAPHS UNDER SOME BINARY OPERATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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