If G is a graph with n vertices, $A_G$ is its adjacency matrix and $\mathbf{b}$ is a binary vector of length n, then the pair $(A_G,\mathbf{b})$ is said to be controllable (or G is said to be controllable for the vector $\mathbf{b}$) if $A_G$ has no eigenvector orthogonal to $\mathbf{b}$. In particular, if $\mathbf{b}$ is the all-1 vector $\mathbf{j}$, then we simply say that G is controllable. In this paper, we consider the controllability of non-complete extended p-sums (for short, NEPSes) of graphs. We establish some general results and then focus the attention to the controllability of paths and related NEPSes. Moreover, the controllability of Cartesian products and tensor products is also considered. Certain related results concerning signless Laplacian matrices and signed graphs are reported.

如果G是一个有n个顶点的图，${\mathrm{一个}}_G$是它的邻接矩阵和$\mathbf{b}$是长度为n的二进制向量，则对$({\mathrm{一个}}_G,\mathbf{b})$被称为是可控的（或者G被称为对于向量是可控的$\mathbf{b}$） 如果${\mathrm{一个}}_G$没有正交的特征向量$\mathbf{b}$. 特别是，如果$\mathbf{b}$是全1向量$\mathbf{j}$，那么我们简单地说G是可控的。在本文中，我们考虑了图的非完全扩展p和（简称 NEPSes）的可控性。我们建立了一些一般性结果，然后将注意力集中在路径和相关 NEPS 的可控性上。此外，还考虑了笛卡尔积和张量积的可控性。报告了有关无符号拉普拉斯矩阵和有符号图的某些相关结果。