Summary: A \(k\)-container \(C(u, v)\) of a graph \(G\) is a set of \(k\) internally disjoint paths between \(u\) and \(v\). A \(k\)-container \(C(u, v)\) of \(G\) is a \(k^\ast\)-container if it is a spanning subgraph of \(G\). A graph \(G\) is \(k^\ast\)-connected if there exists a \(k^\ast\)-container between any two different vertices of G. A \(k\)-regular graph \(G\) is super spanning connected if \(G\) is \(i^\ast\)-container for all \(1 \leq i \leq k\). In this paper, we prove that the arrangement graph \(A_{n, k}\) is super spanning connected if \(n \geq 4\) and \(n - k \geq 2\).