The Bondage Number of Generalized Petersen Graphs Pn,2
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG such that NGD=VG. The bondage number bG of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. The exact value of bPn,2 for n=0,3,4mod 5 and t...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2020/7607856 |
id |
doaj-a02b7494f0c64c0a913301141072f38f |
---|---|
record_format |
Article |
spelling |
doaj-a02b7494f0c64c0a913301141072f38f2020-11-25T02:35:06ZengHindawi LimitedDiscrete Dynamics in Nature and Society1026-02261607-887X2020-01-01202010.1155/2020/76078567607856The Bondage Number of Generalized Petersen Graphs Pn,2Lidan Pei0Xiangfeng Pan1School of Mathematics and Statistics, Hefei Normal University, Hefei, Anhui 230601, ChinaSchool of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, ChinaThe domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG such that NGD=VG. The bondage number bG of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. The exact value of bPn,2 for n=0,3,4mod 5 and the bounds of bPn,2 for n=1,2mod 5 are determined.http://dx.doi.org/10.1155/2020/7607856 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lidan Pei Xiangfeng Pan |
spellingShingle |
Lidan Pei Xiangfeng Pan The Bondage Number of Generalized Petersen Graphs Pn,2 Discrete Dynamics in Nature and Society |
author_facet |
Lidan Pei Xiangfeng Pan |
author_sort |
Lidan Pei |
title |
The Bondage Number of Generalized Petersen Graphs Pn,2 |
title_short |
The Bondage Number of Generalized Petersen Graphs Pn,2 |
title_full |
The Bondage Number of Generalized Petersen Graphs Pn,2 |
title_fullStr |
The Bondage Number of Generalized Petersen Graphs Pn,2 |
title_full_unstemmed |
The Bondage Number of Generalized Petersen Graphs Pn,2 |
title_sort |
bondage number of generalized petersen graphs pn,2 |
publisher |
Hindawi Limited |
series |
Discrete Dynamics in Nature and Society |
issn |
1026-0226 1607-887X |
publishDate |
2020-01-01 |
description |
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG such that NGD=VG. The bondage number bG of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. The exact value of bPn,2 for n=0,3,4mod 5 and the bounds of bPn,2 for n=1,2mod 5 are determined. |
url |
http://dx.doi.org/10.1155/2020/7607856 |
work_keys_str_mv |
AT lidanpei thebondagenumberofgeneralizedpetersengraphspn2 AT xiangfengpan thebondagenumberofgeneralizedpetersengraphspn2 AT lidanpei bondagenumberofgeneralizedpetersengraphspn2 AT xiangfengpan bondagenumberofgeneralizedpetersengraphspn2 |
_version_ |
1715443486063329280 |