期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2016
卷号：13
期号：1
页码：16-21
DOI：10.1016/j.akcej.2016.02.003
语种：English
出版社：Elsevier
摘要：Abstract In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph G with no isolated vertex, is the minimum number of edges that have to be added to G so that the resulting graph has total restrained domination number less than total restrained domination number of G . We obtain sharp bounds, exact values and characterization for the total restrained reinforcement number of a graph.
