The characterizations of -relaxed monotone and maximal -relaxed monotone operators are presented and by defining the resolvent operator associated with a maximal -relaxed monotone operator,
its Lipschitz continuity is proved and an estimate of its Lipschitz constant is computed. By using resolvent operator associated with a maximal -relaxed monotone operator, an iterative algorithm is constructed for approximating a common element of the set of fixed points of a total uniformly -Lipschitzian mapping and the set of solutions of a variational inclusion problem involving maximal -relaxed monotone operators. By employing the concept of graph convergence for maximal -relaxed monotone operators, a new equivalence relationship between the graph convergence of a sequence of maximal -relaxed monotone operators and their associated resolvent operators, respectively, to a given maximal -relaxed monotone operator and its associated resolvent operator is established. At the end, we study the strong convergence of the sequence generated by the proposed iterative algorithm to a common element of the above mentioned sets.