STRONG EFFICIENT EDGE BONDAGE NUMBER OF SOME GRAPHS

2020 ◽  
Vol 9 (5) ◽  
pp. 2663-2672
Author(s):  
M. Annapoopathi ◽  
N. Meena
Keyword(s):  
Bondage Number

The p-Bondage Number of Trees

2010 ◽  
Vol 27 (1) ◽  
pp. 129-141 ◽  
Author(s):  
You Lu ◽  
Jun-Ming Xu
Keyword(s):  
Bondage Number

scholarly journals Roman { 2}-bondage number of a graph

2020 ◽  
Vol 40 (1) ◽  
pp. 255 ◽  
Author(s):  
Doost Ali Mojdeh ◽  
Ahmad Moradi ◽  
Omid Sharifi
Keyword(s):  
Bondage Number

Open packing bondage number of a graph

2019 ◽  
Vol 11 (05) ◽  
pp. 1950051
Author(s):  
S. Saravanakumar ◽  
A. Anitha ◽  
I. Sahul Hamid
Keyword(s):  
Maximum Cardinality ◽  
Common Neighbor ◽  
Packing Number ◽  
Bondage Number ◽  
Open Packing

In a graph [Formula: see text], a set [Formula: see text] is said to be an open packing set if no two vertices of [Formula: see text] have a common neighbor in [Formula: see text] The maximum cardinality of an open packing set is called the open packing number and is denoted by [Formula: see text]. The open packing bondage number of a graph [Formula: see text], denoted by [Formula: see text], is the cardinality of the smallest set of edges [Formula: see text] such that [Formula: see text]. In this paper, we initiate a study on this parameter.

Restrained bondage number of a graph

2009 ◽  
Vol 12 (3) ◽  
pp. 373-380
Author(s):  
R. Kala ◽  
T. R. Nirmala Vasantha
Keyword(s):  
Bondage Number

scholarly journals The bondage number of a graph

1990 ◽  
Vol 86 (1-3) ◽  
pp. 47-57 ◽  
Author(s):  
John Frederick Fink ◽  
Michael S. Jacobson ◽  
Lael F. Kinch ◽  
John Roberts
Keyword(s):  
Bondage Number

scholarly journals The total bondage number of grid graphs

2012 ◽  
Vol 160 (16-17) ◽  
pp. 2408-2418 ◽  
Author(s):  
Fu-Tao Hu ◽  
You Lu ◽  
Jun-Ming Xu
Keyword(s):  
Grid Graphs ◽  
Bondage Number

A note on the 2-rainbow bondage numbers in graphs

2016 ◽  
Vol 09 (01) ◽  
pp. 1650013
Author(s):  
L. Asgharsharghi ◽  
S. M. Sheikholeslami ◽  
L. Volkmann
Keyword(s):  
Planar Graph ◽  
Maximum Degree ◽  
Minimum Weight ◽  
Domination Number ◽  
Minimum Cardinality ◽  
Bondage Number ◽  
Rainbow Domination ◽  
Vertex Set ◽  
Number Formula ◽  
Appl Math

A 2-rainbow dominating function (2RDF) of a graph [Formula: see text] is a function [Formula: see text] from the vertex set [Formula: see text] to the set of all subsets of the set [Formula: see text] such that for any vertex [Formula: see text] with [Formula: see text], the condition [Formula: see text] is fulfilled. The weight of a 2RDF [Formula: see text] is the value [Formula: see text]. The [Formula: see text]-rainbow domination number of a graph [Formula: see text], denoted by [Formula: see text], is the minimum weight of a 2RDF of [Formula: see text]. The rainbow bondage number [Formula: see text] of a graph [Formula: see text] with maximum degree at least two is the minimum cardinality of all sets [Formula: see text] for which [Formula: see text]. Dehgardi, Sheikholeslami and Volkmann, [The [Formula: see text]-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 [Formula: see text]-cell embedding on a surface with non-negative Euler characteristic.

Sign in / Sign up

Export Citation Format

Share Document