PATTERN statements create PATTERN definitions that define the color and type of area fill for patterns used in graphs. These are the procedures and the graphics areas that they create that use PATTERN ...

Let 𝐺 = (𝑉, 𝐸) be a connected graph. A locating-total dominating set in a graph 𝐺 is a total dominating set 𝑆 of a 𝐺, for every pair of vertices 𝑖, 𝑗∈ 𝑉(𝐺) \ 𝑆, such that 𝑁(𝑖) ∩𝑆 = ≠ ...