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.
