About this document
Cost Effective Domination in Graphs by HEARTY NUENAY is a document available to read on EtoBox.
The paper investigates cost effective dominating sets in the join, corona, and composition of graphs, defining key concepts such as cost effective domination number and minimal cost effective domination number. It presents characterizations and bounds for these numbers in the context of various graph operations. The results contribute to the understanding of domination theory in graph theory, providing specific conditions under which certain sets qualify as cost effective dominating sets.
- Author
- HEARTY NUENAY
- Language
- EN