Title of article
Upper bounds on the paired-domination number Original Research Article
Author/Authors
Zhendong Shao، نويسنده , , Roger K. Yeh، نويسنده , , Kin Keung Poon، نويسنده , , Wai Chee Shiu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
5
From page
1194
To page
1198
Abstract
A set SS of vertices in a graph GG is a paired-dominating set of GG if every vertex of GG is adjacent to some vertex in SS and the subgraph induced by SS contains a perfect matching. The minimum cardinality of a paired-dominating set of GG is the paired-domination number of GG, denoted by γpr(G)γpr(G). In this work, we present several upper bounds on the paired-domination number in terms of the maximum degree, minimum degree, girth and order.
Keywords
Paired-domination number , Maximum degree , Minimum degree , Girth
Journal title
Applied Mathematics Letters
Serial Year
2008
Journal title
Applied Mathematics Letters
Record number
898727
Link To Document