paper

Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs

arXiv:2002.01347

Abstract

A total Roman dominating function on a graph is a function such that every vertex with is adjacent to some vertex with , and the subgraph of induced by the set of all vertices such that has no isolated vertices. The weight of is . The total Roman domination number is the minimum weight of a total Roman dominating function on . A graph is --edge-critical if for every edge , and --edge-supercritical if it is --edge-critical and for every edge . A graph is --edge-stable if for every edge or . For an edge incident with a degree vertex, we define . A graph is --edge-removal-critical if for every edge , and --edge-removal-supercritical if it is --edge-removal-critical and for every edge . A graph is --edge-removal-stable if for every edge . We investigate connected -edge-supercritical graphs and exhibit infinite classes of such graphs. In addition, we characterize -edge-removal-critical and -edge-removal-supercritical graphs. Furthermore, we present a connection between --edge-removal-supercritical and --edge-stable graphs, and similarly between --edge-supercritical and --edge-removal-stable graphs.

20 pages, 2 figures. arXiv admin note: text overlap with arXiv:1907.08639

Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs · wovepaper