(1)
$H_{1}(X; \mathbb Z)$ is of rank $n > 1$, so $X \simeq \bigvee_{n} S^{1}$.
Consider $X = \bigvee_{n} S^{1}$ first.
To show $\phi: G \to GL_{n}(\mathbb Z)$ is injective, suppose $g: X \to X$ is homeomorphism s.t. $\phi(g) = \text{id}$, then $g$ maps each $S^{1}$ to itself and fixes the wedge point $x_{0}$.
Let $f = g|_{S^{1}}: S^{1} \to S^{1}$, then $f$ fixes $x_{0}$ and $f_{*} = \text{id}$, so $f$ preserves the orientation.
$G$ is finite group, so $f$ is of finite order and there exists a smallest positive integer $k$ s.t. $f{^k}=\text{id}$.
Let $y \in S^{1}$, $f(y) \neq y$, then points $y, f(y), f^{2}(y), \cdots, f^{k}(y) = y$ are permuted in $S^{1}$ clockwise or counterclockwise since $f$ preserves the orientation.
Arc between $f^{i}(y)$ and $f^{i+1}(y)$ is mapped by $f$ to the next one, and such arcs cover $S^{1}$, so one of these arcs contains $x_{0}$, but $f$ fixes $x_{0}$. Contradiction.
Thus $f = \text{id}: S^{1} \to S^{1}$ and $g = \text{id}: \bigvee_{n} S^{1} \to \bigvee_{n} S^{1}$.
(2)
For general finite connected graph $X \simeq \bigvee_{n} S^{1}$ $(n \ge 2)$, there exists a vertex $x_{0}$ of valence $\ge 3$.
$x_{0}$ belongs to different loops based at $x_{0}$, and $g$ maps loops to themselves and preserves the orientation, so $g$ fixes $x_{0}$, and the followings are the same as the situation for $\bigvee_{n} S^{1}$.
(3)
For coefficient group to be $\mathbb Z_{m}$, $\phi: G \to GL_{n}(\mathbb Z_{m})$. Suppose $g: X \to X$ is homeomorphism s.t. $\phi(g) = \text{id}$.
If $m > 2$, then $g$ preserves the orientation in each loop since $-\overline{1} = \overline{m-1} \neq \overline{1}$.
If $m = 2$, $g$ may reverse the orientation in some loop since $-\overline{1} = \overline{1}$.
https://math.stackexchange.com/questions/1761707/homeomorphisms-on-a-finite-connected-graph-x-with-h-1x-bbb-z-free-abelia/4839491#4839491
– D Ford Jan 05 '24 at 21:44