Recently, a research team from Hokkaido University made significant progress in the complexity study of the Hitting Geodesic Intervals (HGI) problem. The HGI problem aims to find a small set of ...

Let R be a ring. The unit graph of R, denoted by G(R), is the simple graph defined on all elements of R, and where two distinct vertices x and y are linked by an edge if and only if x+y is a unit of R ...

Abstract The adjacent vertex-distinguishing total chromatic number of a graph 𝐺, denoted by χ𝑎𝑡 (𝐺), is the smallest denoted by 𝑘 for which 𝐺 has a proper total 𝑘-coloring such that any two ...