location: Current position: Home >> Scientific Research >> Paper Publications

On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)

Hits:

Indexed by:期刊论文

Date of Publication:2011-05-01

Journal:JOURNAL OF COMBINATORIAL OPTIMIZATION

Included Journals:SCIE、EI

Volume:21

Issue:4

Page Number:481-496

ISSN No.:1382-6905

Key Words:Paired domination number; k-distance paired domination number; Generalized Petersen graph

Abstract:Let G=(V,E) be a graph without an isolated vertex. A set DaS dagger V(G) is a k -distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph aOE (c) D > has a perfect matching. The minimum cardinality of a k-distance paired dominating set for graph G is the k -distance paired domination number, denoted by gamma (p) (k) (G). In this paper, we determine the exact k-distance paired domination number of generalized Petersen graphs P(n,1) and P(n,2) for all ka parts per thousand yen1.

Pre One:Fault-tolerant edge-pancyclicity of locally twisted cubes

Next One:On the 3-gamma(t)-Critical Graphs of Order Delta(G)+3