| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646514 | AKCE International Journal of Graphs and Combinatorics | 2016 | 6 Pages |
Abstract
In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph GG with no isolated vertex, is the minimum number of edges that have to be added to GG so that the resulting graph has total restrained domination number less than total restrained domination number of GG. We obtain sharp bounds, exact values and characterization for the total restrained reinforcement number of a graph.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nader Jafari Rad, Lutz Volkmann,