关键词：支配集 控制数 顶点 孤立 价值观 

摘要：A subset S of vertices of a graph G with no isolated vertex is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex in V (G) S is also adjacent to a vertex in V (G) S. The total restrained domination number of G is the minimum cardinality of a total restrained dominating set of G. In this paper we initiate the study of total restrained bondage in graphs. The total restrained bondage number in a graph G with no isolated vertex, is the minimum cardinality of a subset of edges E such that G E has no isolated vertex and the total restrained domination number of G E is greater than the total restrained domination number of G. We obtain several properties, exact values and bounds for the total restrained bondage number of a graph.

数学学报杂志要求:

{1}作者姓名的汉语拼音应姓前名后，姓氏全部字母为大写，名字的首字母大写，双名中间不加连字符不间隔；汉语拼音的作者姓名写在英文表示的工作单位之前；多位作者的署名之间以逗号隔开；不同单位的作者姓名右上角加注序号。

{2}编辑部有权酌情删改来稿，如不同意请予说明。

{3}计量单位一律采用中国国家法定计量单位，有国际符号的计量单位均用符号表示；数值和国际计量单位间应有空格，若之间有汉字则无须空格；复合单位不使用除法格式，而使用乘积格式。

{4}注释以“①”“②”“③”等标注，并以脚注形式按序排列。

{5}基金资助信息：列出基金项目名称与编号。

注：因版权方要求，不能公开全文，如需全文，请咨询杂志社