For an ordered set $W=\{w_1,w_2,\cdots ,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the representation of $v$ with respect to $W$ is the $k$-vector $r\left(v\right|W)$ = ($d(v,w_1)$, $d(v,w_2),\cdots ,d(v,w_k))$, where $d(x,y)$ represents the distance between the vertices $x$ and $y$. The set $W$ is a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. A resolving set for $G$ containing a minimum number of vertices is a basis for $G$. The dimension $dim\left(G\right)$ is the number of vertices in a basis for $G$. A resolving set $W$ of $G$ is connected if the subgraph...

For an ordered $k$-decomposition $𝒟=\{G_1,G_2,...,G_k\}$ of a connected graph $G$ and an edge $e$ of $G$, the $𝒟$-code of $e$ is the $k$-tuple $c_{𝒟}\left(e\right)$ = ($d(e,G_1),$$d(e,G_2$

We study two topological properties of the 5-ary $n$-cube $Q_n^5$. Given two arbitrary distinct nodes $x$ and $y$ in $Q_n^5$, we prove that there exists an $x$-$y$ path of every length ranging from $2n$ to $5^n-1$, where $n\ge 2$. Based on this result, we prove that $Q_n^5$ is 5-edge-pancyclic by showing that every edge in $Q_n^5$ lies on a cycle of every length ranging from $5$ to $5^n$.

We study two topological properties of the 5-ary n-cube $Q_n^5$. Given two arbitrary distinct nodes x and y in $Q_n^5$, we prove that there exists an x-y path of every length ranging from 2n to 5n - 1, where n ≥ 2. Based on this result, we prove that $Q_n^5$ is 5-edge-pancyclic by showing that every edge in $Q_n^5$ lies on a cycle of every length ranging from 5 to 5n.