On total domination and total equitable domination in graphs

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

dc.contributor.author	Vaidya, S. K.
dc.contributor.author	Parmar, A. D.
dc.date.accessioned	2024-11-25T05:31:47Z
dc.date.available	2024-11-25T05:31:47Z
dc.date.issued	2018
dc.identifier.citation	Vaidya, S. K., & Parmar, A. D. (2018). On total domination and total equitable domination in graphs. Malaya Journal of Matematik, 6(02), 375-380.	en_US
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/1989
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	Malaya Journal of Matematik	en_US
dc.subject	Dominating set	en_US
dc.subject	Equitable dominating	en_US
dc.subject	Total dominating set;	en_US
dc.subject	Bondage number.	en_US
dc.title	On total domination and total equitable domination in graphs	en_US
dc.type	Article	en_US