Bibliographic Details
| Title: |
A note on the 2-rainbow bondage numbers in graphs. |
| Authors: |
Asgharsharghi, L., Sheikholeslami, S. M., Volkmann, L. |
| Superior Title: |
Asian-European Journal of Mathematics; Mar2016, Vol. 9 Issue 1, p-1, 7p |
| Abstract: |
A 2-rainbow dominating function (2RDF) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with , the condition is fulfilled. The weight of a 2RDF is the value . The -rainbow domination number of a graph , denoted by , is the minimum weight of a 2RDF of . The rainbow bondage number of a graph with maximum degree at least two is the minimum cardinality of all sets for which . Dehgardi, Sheikholeslami and Volkmann, [The -rainbow bondage number of a graph, Discrete Appl. Math. 174 (2014) 133-139] proved that the rainbow bondage number of a planar graph does not exceed 15. In this paper, we generalize their result for graphs which admit a -cell embedding on a surface with non-negative Euler characteristic. [ABSTRACT FROM AUTHOR] |
|
Copyright of Asian-European Journal of Mathematics is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
