Title of article
On weakly connected domination in graphs Original Research Article
Author/Authors
Jean E. Dunbar، نويسنده , , Jerrold W. Grossman، نويسنده , , Johannes H. Hattingh، نويسنده , , Stephen T. Hedetniemi، نويسنده , , Alice A. McRae، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
9
From page
261
To page
269
Abstract
A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, γw, and related domination parameters. It is shown that the problem of computing γw is NP-hard in general but linear for trees. In addition, several sharp upper and lower bounds for γw are obtained.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951785
Link To Document