Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems, computer and social networks, monitoring communication, coding theory, and algorithm design, among others. In the last two decades, the functions defined on graphs have attracted the attention of several researchers. The Roman-dominating functions and their variants are one of the main attractions. This paper is a contribution to the Roman domination theory in graphs. In particular, we provide some interesting properties and relationships between one of its variants: the quasi-total Roman domination in graphs.