Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/1886
Title: Some More Results on Total Equitable Bondage Number of A Graph
Authors: Vaidya, S. K.
Parmar, A. D
Keywords: Dominating set
Equitable dominating set
Total dominating set
Bondage number.
Issue Date: 2019
Publisher: Journal of Scientific Research
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.
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.
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/1886
ISSN: 2070-0237
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
Some More Results on Total Equitable Bondage Number of A Graph.pdf317 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.