On the independent domination number of the generalized Petersen graphs

کاظمی پیله درق, عادل (2009) On the independent domination number of the generalized Petersen graphs. University of Mohaghegh Ardabili.

[img] Text
MAIN.pdf

Download (478kB)

Abstract

Here we consider an infinite sub-family of the generalized Petersen graphs P(n,k) for n = 2k + 1 >= 3, and using the two algorithms that A.Behzad et al. presented in [A. Behzad, M.Gehzad, C. E. Praeger, On the domination number of the generalized Peterson graphs, Discrete Mathematics 308 (2008) 603-610.] we determine an upper bound and a lower bound for the independent. domination numbers of these graphs.

Item Type: Other
Persian Title: در مورد عدد احاطه کنندگی مستقل گراف های توسعه یافته پترسن
Persian Abstract: -
Subjects: Research Projects
Divisions: Subjects > Faculty of Basic Sciences > Department of Mathematics
Faculty of Basic Sciences > Department of Mathematics
Date Deposited: 23 Jun 2019 06:56
Last Modified: 23 Jun 2019 06:56
URI: http://repository.uma.ac.ir/id/eprint/8162

Actions (login required)

View Item View Item