Client-server and cost effective sets in graphs
type: Item
instance of: scholarly article
title: Client-server and cost effective sets in graphs
zbMATH Open document ID: 1403.05111
author: Mustapha Chellali
author: Teresa W. Haynes
author: Stephen T. Hedetniemi
published in: AKCE International Journal of Graphs and Combinatorics
publication date: 2019-01-25T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7006948
zbMATH Keywords: cost effective sets
zbMATH Keywords: \(k\)-cost-effective sets
zbMATH Keywords: domination
zbMATH Keywords: \(k\)-cost effective domination
zbMATH Keywords: global \(k\)-offensive alliances
MaRDI profile type: Publication
full work available at URL: j.akcej.2017.09.001
OpenAlex ID: W2774370208
cites work: SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS
cites work: Q3691778
cites work: Q3691779
cites work: \(k\)-domination and \(k\)-independence in graphs: A survey
cites work: Q5488331
cites work: Cost effective domination in graphs
cites work: Bounds on cost effective domination numbers
cites work: Very cost effective bipartitions in graphs
cites work: On the corona of two graphs
cites work: Onk-domination and minimum degree in graphs
cites work: Q4820818
cites work: Q4472692
cites work: Q5488895
cites work: Q3423990
DOI: 10.1016/J.AKCEJ.2017.09.001
description: scientific article; zbMATH DE number 7006948