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

Cayley graphs provide a powerful and intuitive framework linking group theory with graph theory by representing groups through vertices and edges defined by a generating set. In the realm of finite ...

Carpathian Journal of Mathematics, Vol. 34, No. 2 (2018), pp. 143-155 (13 pages) In the paper, we extend known results concerning crossing numbers for join of graphs of order six. We give the crossing ...

All quadratic functions have the same type of curved graphs with a line of symmetry. The graph of the quadratic function \(y = ax^2 + bx + c \) has a minimum turning point when \(a \textgreater 0 \) ...

Through a Summer Undergraduate Research Fellowship, Jenny Quan is exploring the mathematical principles behind Rubik's cubes.

This circle has the centre at the origin and a radius of 1 unit. The point P can move around the circumference of the circle. At point P the \(x\)-coordinate is \(\cos{\theta}\) and the ...