This paper initiates a study on a new optimization problem with regards to graph completion. The defined procedure is called, \emph{Marcello's completion} of a graph. For graph $G$ of order $n$ the \emph{Marcello number} is obtained by iteratively constructing graphs, $G_1,G_2,\dots,G_k$ by adding a maximal number of edges between pairs of distinct, non-adjacent vertices in accordance with the \emph{Marcello rule}. If for smallest $k$ the resultant graph $G_k \cong K_n$ then the Marcello number of a graph $G$ denoted by $\varpi(G)$ is equal to $\varpi(G) = k$. By convention $\varpi(K_n) = 0$, $n \geq 1$. Certain introductory results are presented.