Graph functionality

Let $G=(V,E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \in V$ is a function of vertices $x_1, \ldots, x_k \in V$ if there exists a Boolean function $f$ of $k$ variables such that for any vertex $z \in V - \{y, x_1, \ldots, x_k\}$, $A(y,z)=f(A(x_1,z),\ldots,A(x_k,z))$. The fun... View More