“School of Mathematics”Back to Papers Home
Back to Papers of School of Mathematics
|Paper IPM / M / 11322||
A graph with no isolated vertices is edge critical with respect to total restrained domination if for any non-edge e of G, the total restrained domination number of G+e is less than the total restrained domination number of G. We call these graphs γtr-edge critical. In this paper, we characterize all γtr-edge critical unicyclic graphs.
Download TeX format
|back to top|