%0 Journal Article
%T Some More Results on Total Equitable Bondage Number of A Graph
%A A. D. Parmar
%A S. K. Vaidya
%J Journal of Scientific Research
%D 2019
%R https://doi.org/10.3329/jsr.v11i3.40573
%X The bondage number b(G) of a nonempty graph G is the minimum cardinality among all sets of edges E0 £¿ E(G) for which ¦Ã(G-E0) > ¦Ã (G). An equitable dominating set D is called a total equitable dominating set if the induced subgraph < D > has no isolated vertices. The total equitable domination number ¦Ãte(G) of G is the minimum cardinality of a total equitable dominating set of G. If ¦Ãte(G) ¡Ù |V(G)| and <G-E0> contains no isolated vertices then the total equitable bondage number bte(G) of a graph G is the minimum cardinality among all sets of edges E0 £¿ E(G) for which ¦Ãte(G-E0) > ¦Ãte(G). In the present work we prove some characterizations and investigate total equitable bondage number of Ladder and degree splitting of path
%U https://www.banglajol.info/index.php/JSR/article/view/40573