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 |