Client-server and cost effective sets in graphs
From MaRDI portal
Publication:1713579
DOI10.1016/J.AKCEJ.2017.09.001zbMath1403.05111OpenAlexW2774370208MaRDI QIDQ1713579
Stephen T. Hedetniemi, Mustapha Chellali, Teresa W. Haynes
Publication date: 25 January 2019
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2017.09.001
domination\(k\)-cost effective domination\(k\)-cost-effective setscost effective setsglobal \(k\)-offensive alliances
Related Items (2)
On k-cost effective domination in the corona and lexicographic product of graphs and its variant ⋮ Alliances and Related Domination Parameters
Cites Work
- Very cost effective bipartitions in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On the corona of two graphs
- Onk-domination and minimum degree in graphs
- Bounds on cost effective domination numbers
- SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Client-server and cost effective sets in graphs