Publication Type:

Journal Article

Source:

Journal of Discrete Mathematical Sciences and Cryptography, Taylor & Francis, Volume 1, Number 1, p.79–84 (1998)

Abstract:

Let G = (V, E) be a graph. The negative split bondage number

of G is the minimum cardinality among all sets of edges X ⊂ E such that γ s (G − S) < γ s (G) and the split bondage number bs (G) of G is the minimum cardinality among all sets of edges X ⊂ E such that γ s (G − X) > γ s (G), where γ s (G) is the split domination number of G. In this paper, we initiate a study of these two new parameters.

Cite this Research Publication

V. R. Kulli, Janakiram, B., and Iyer, R. R., “Split bondage numbers of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 1, pp. 79–84, 1998.

207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS