Title of article
Efficient Open Domination
Author/Authors
Heather Gavlas، نويسنده , , Heather and Schultz، نويسنده , , Kelly، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
11
From page
681
To page
691
Abstract
A set S of vertices of a graph G is called an efficient open domination set for G if the set of neighborhoods {N(v)⫫ v ϵ S} forms a partition of V(G). A graph is an efficient open domination graph if it contains an efficient open domination set. Several properties of efficient open domination sets and efficient open domination graphs are determined. All efficient open domination trees are described. The efficient open domatic number of a graph is defined and studied.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2002
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453360
Link To Document