The Bondage Number of Generalized Petersen Graphs

Lidan Pei and Xiangfeng Pan

Discrete Dynamics in Nature and Society, 2020, vol. 2020, 1-11

Abstract:

The domination number of a nonempty graph is the minimum cardinality among all subsets such that . The bondage number of a graph is the smallest number of edges whose removal from results in a graph with larger domination number. The exact value of for and the bounds of for are determined.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2020/7607856.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2020/7607856.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:7607856

DOI: 10.1155/2020/7607856

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().