Characterization of graphs with orientable total domination number equal to |V| - 1
An orientation of a graph \(G\) is valid if the in-degree of every vertex is at least \(1\). The upper orientable total domination number \(\mathrm{DOM}_t(G)\) is the maximum total domination number over all valid orientations of \(G\). In the main result of this paper, graphs with \(\mathrm{DOM}_t(G) = |V(G)| - 1\) are characterized. When \(G\) is connected, these graphs can be described as a union of four different families, and if \(G\) is not connected, then \(G\) is a disjoint union of some cycles and a graph from the union of the mentioned four families. Two infinite families of graph are also constructed such that a graph \(G\) from these two families simultaneously satisfies \(\mathrm{DOM}_t(G) = |V(G)| - 1\) and \(\mathrm{dom}_t(G) = 3\), where \(\mathrm{dom}_t(G)\) is the lower orientable total domination number of \(G\).
This page was built for publication: Characterization of graphs with orientable total domination number equal to \(|V| - 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906748)
