Ma, Qiaoling and Zhang, Sumei and Wang, Jihui (2010) Bondage Number of 1-Planar Graph. Applied Mathematics, 01 (02). pp. 101-103. ISSN 2152-7385
Text
AM20100200003_20152540.pdf - Published Version
Download (155kB)
AM20100200003_20152540.pdf - Published Version
Download (155kB)
Official URL: https://doi.org/10.4236/am.2010.12013
Abstract
The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.
Item Type: | Article |
---|---|
Subjects: | European Scholar > Mathematical Science |
Depositing User: | Managing Editor |
Date Deposited: | 05 Jun 2023 04:21 |
Last Modified: | 17 Jan 2024 04:00 |
URI: | http://article.publish4promo.com/id/eprint/1870 |