Some More Results on Total Equitable Bondage Number of A Graph

Vaidya, S. K.; Parmar, A. D

dc.contributor.author	Vaidya, S. K.
dc.contributor.author	Parmar, A. D
dc.date.accessioned	2024-11-21T10:39:02Z
dc.date.available	2024-11-21T10:39:02Z
dc.date.issued	2019
dc.identifier.citation	Vaidya, S. K., & Parmar, A. D. (2019). Some More Results on Total Equitable Bondage Number of A Graph: Total Equitable Bondage Number of A Graph. Journal of Scientific Research, 11(3), 303-309.	en_US
dc.identifier.issn	2070-0237
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1886
dc.description.abstract	The bondage number of a nonempty graph is the minimum cardinality among all sets of edges for which. An equitable dominating set is called a total equitable dominating set if the induced subgraph has no isolated vertices. The total equitable domination number of is the minimum cardinality of a total equitable dominating set of. If and contains no isolated vertices then the total equitable bondage number of a graph is the minimum cardinality among all sets of edges for which. In the present work we prove some characterizations and investigate total equitable bondage number of Ladder and degree splitting of path.	en_US
dc.language.iso	en	en_US
dc.publisher	Journal of Scientific Research	en_US
dc.subject	Dominating set	en_US
dc.subject	Equitable dominating set	en_US
dc.subject	Total dominating set	en_US
dc.subject	Bondage number.	en_US
dc.title	Some More Results on Total Equitable Bondage Number of A Graph	en_US
dc.type	Article	en_US