Split bondage numbers of a graph

Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5422

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kulli V.R
dc.contributor.author	Janakiram B
dc.contributor.author	Iyer R.R.
dc.date.accessioned	2020-06-12T15:07:59Z	-
dc.date.available	2020-06-12T15:07:59Z	-
dc.date.issued	1998
dc.identifier.citation	Journal of Discrete Mathematical Sciences and Cryptography , Vol. 1 , 1 , p. 79 - 84	en_US
dc.identifier.uri	10.1080/09720529.1998.10697867
dc.identifier.uri	http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5422	-
dc.description.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. © 1998 Taylor & Francis Group, LLC.	en_US
dc.title	Split bondage numbers of a graph	en_US
dc.type	Article
Appears in Collections:	1. Journal Articles

Files in This Item:

There are no files associated with this item.

GULBARGA UNIVERSITY, KALABURAGI Institutional Repository