Title of article
On the domination number of generalized Petersen graphs
Author/Authors
Fu، نويسنده , , Xueliang and Yang، نويسنده , , Yuansheng and Jiang، نويسنده , , Baoqi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
2445
To page
2451
Abstract
Let G = ( V ( G ) , E ( G ) ) be a graph. A set S ⊆ V ( G ) is a dominating set if every vertex of V ( G ) − S is adjacent to some vertex in S . The domination number γ ( G ) of G is the minimum cardinality of a dominating set of G . In this paper, we study the domination number of generalized Petersen graphs P ( n , 2 ) and prove that γ ( P ( n , 2 ) ) = n − ⌊ n 5 ⌋ − ⌊ n + 2 5 ⌋ .
Keywords
dominating set , generalized Petersen graph , Domination number
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598713
Link To Document