Cost effective domination in the join, corona and composition of graphs

zbMATH Open1438.05090MaRDI QIDQ5230847FDOQ5230847

Authors: Ferdinand P. Jamil, Hearty M. Nuenay-Maglanque 

Publication date: 29 August 2019

Full work available at URL: https://www.ejpam.com/index.php/ejpam/article/view/3443

Recommendations

• On k-cost effective domination in the corona and lexicographic product of graphs and its variant
• Cost effective domination in graphs
• Bounds on cost effective domination numbers
• Domination in the corona and join of graphs
• On connected co-independent domination in the join, corona and lexicographic product of graphs

zbMATH Keywords

coronacompositionjoincost effective dominating setscost effective domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Cost effective domination in graphs
• A sufficient condition for dominating cycles
• On minimal geodetic domination in graphs
• Domination in the corona and join of graphs
• Bounds on cost effective domination numbers
• On maximum number of minimal dominating sets in graphs

Cited In (7)

• Cost effective domination in graphs
• Title not available (Why is that?)
• Bounds on cost effective domination numbers
• Forcing domination numbers of graphs under some binary operations
• Alliances and Related Domination Parameters
• Client-server and cost effective sets in graphs
• On k-cost effective domination in the corona and lexicographic product of graphs and its variant

This page was built for publication: Cost effective domination in the join, corona and composition of graphs

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