On connected cutfree domination in graphs
type: Item
instance of: scholarly article
title: On connected cutfree domination in graphs
zbMATH Open document ID: 0772.05054
author: J. Paulraj Joseph
author: S. Arumugam
published in: Indian Journal of Pure \& Applied Mathematics
publication date: 1993-01-17T00:00:00Z
review text: Let \(G=(V,E)\) be a finite connected and undirected graph without loops or multiple edges. For \(S\subseteq V\) let \(\langle S\rangle\) be the subgraph of \(G\) induced by \(S\). \(S\) is a dominating set if every vertex in \(V\backslash S\) is adjacent to some vertex in \(S\). The connected cutfree domination number \(\gamma_{cc}(G)\) is the cardinality of a minimum dominating set \(S\) whereof \(\langle S\rangle\) is cutnode-free. The block domination number \(\gamma_ b(G)\) is the cardinality of a minimum dominating set \(S\), such that \(\langle S\rangle\) is a block of \(G\). \(\gamma_{cc}\) and \(\gamma_ b\) are defined and related to other domination numbers.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 96613
zbMATH Keywords: dominating set
zbMATH Keywords: connected cutfree domination
zbMATH Keywords: domination number
reviewed by: Jürgen Ebert
MaRDI profile type: Publication
Recommended article: Q3340900
Recommended article: On connected \(k\)-domination in graphs
Recommended article: Q4381222
Recommended article: Q3561427
Recommended article: Connected domination critical graphs with cut vertices
Recommended article: Q4857888
Recommended article: Connected lict domination in graphs
Recommended article: On the outer-connected domination in graphs
Recommended article: Bounds on the connected domination number of a graph
Recommended article: Q4898492
description: scientific article; zbMATH DE number 96613