Back close

Split bondage numbers of a graph

Publication Type : Journal Article

Publisher : Taylor & Francis

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

Campus : Bengaluru

School : School of Engineering

Department : Mathematics

Year : 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.

Admissions Apply Now