This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct blocks. We establish closed-form expressions and recursive identities for fundamental graph families, including \textbf{Path} ($P_n$), \textbf{Cycle} ($C_n$), \textbf{Star} ($S_n$), \textbf{Wheel} ($W_n$), and \textbf{Fan} ($F_n$) graphs. A primary focus of this study is the \textbf{statistical characterization} of the cycle distribution. We derive explicit formulas for the \textbf{mean} and \textbf{variance} of these numbers, extracted from the structural properties of the $r$-cycle polynomials. These results provide a rigorous measure of the average cycle density and variability across different graph topologies, bridging the gap between algebraic combinatorics and the structural analysis of restricted permutations.