Matchings in \(4\)-Total Restrained Domination Vertex Critical Graphs

Abstract

A graph \(G\) with no isolated vertex is total restrained domination vertex critical if for any vertex \(v\) of \(G\) that is not adjacent to a vertex of degree one, the total restrained domination number of \(G – v\) is less than the total restrained domination number of \(G\). We call these graphs \(\gamma_{tr}\)-vertex critical. If such a graph \(G\) has total restrained domination number \(k\), we call it \(k\)-\(\gamma_{tr}\)-vertex critical. In this paper, we study matching properties in \(4\)-\(\gamma_{tr}\)-vertex critical graphs of minimum degree at least two.