No label defined (Q4393379)

Let \(G\) be a simple graph of order \(p\geq n\) and size \(q\) with vertex set \(V(G)\) and edge set \(E(G)\). The \(n\)-tuple vertex graph of the graph \(G, V_n(G),\) is defined as follows: (1) the vertex set of \(V_n(G)\) consists of all \(n\)-subsets of \(V(G)\), and (2) two vertices \(u=\{x_1, x_2,\dots,x_n\}\) and \(v=\{y_1, y_2,\dots, y_n\}\) are adjacent if \(| u\cap v| =1\) and the vertices \(x\in u-v\) and \(y\in v-u\) are adjacent in \(G\). The notion of the \(n\)-tuple vertex graph was introduced by \textit{Y. Alavi, M. Behzad, P. Erdős} and \textit{D. R. Lick} [J. Comb. Inf. Syst. Sci 16, No. 1, 37-50 (1991; Zbl 0764.05077)] for \(n=2\). The present paper brings simple observations also for \(n\geq 3\) and, particulary, the relationship of \(V_2(G)\) with the line graph \(L(G)\) of a graph \(G\).