Weakly connected domination critical graphs

A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\). The weakly connected domination number \(\gamma_w(G)\) of a gra...

Full description

Bibliographic Details
Main Authors: Magdalena Lemańska, Agnieszka Patyk
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2008-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2824.pdf