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 ...

Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...

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 𝑁(𝑖) ∩𝑆 = ≠ ...

A function is a rule that is applied to one set of values to give another set of values. A function can be illustrated on a graph – points are plotted as coordinates and joined by either a straight ...