
The paper characterizes the families of connected graphs where the maximum total domination number achievable over all possible valid orientations of the graph (orientable total domination number) is precisely one less than the total number of vertices in the graph.


coremsg

characterization-of-connected-graphs-where-the-orientable-total-domination-number-is-one-less-than-the-number-of-vertices


Characterization of Connected Graphs Where the Orientable Total Domination Number Is One Less Than the Number of Vertices
