The total bondage numbers and efficient total dominations of vertex-transitive graphs

摘要

The total domination number of a graph G without isolated vertices is the minimum number of vertices that dominate all vertices in G. The total bondage number of G is the minimum number of edges whose removal enlarges the total domination number. In this paper, we establish a tight lower bound for the total bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the relation between the total bondage number and the efficient total domination. As applications, we study the total bondage numbers for some circulant graphs and toroidal meshes by characterizing the existence of efficient total dominating sets in these graphs.