A name for layered directed graph as in a fully-connected neural network

Question

Is there a common name for the type of directed acyclic graph structure used in fully-connected neural networks?
E.g.

To be specific, I'm speaking of a directed graph, $G=(V,E)$, whose vertices can be partitioned into $k$ non-empty disjoint sets $V_1, ..., V_k$ such that $V = \displaystyle\bigcup_{i=1}^k V_i$ and $E = \displaystyle\bigcup_{i=1}^{k-1} V_i\times V_{i+1}$.

Answer 1

In the book Planning Algorithms by Steven M. LaValle, there is another name for that graph on page 65.

A layered graph is a graph that has its vertices partitioned into a sequence of layers, and its edges are only permitted to connect vertices between successive layers.

Although this is more general than the "fully-connected" case.

In addition, I found the name to be quite useless to find other literature. It seems to only give results on a different concept, layered graph drawing.

Answer 2

No. At least not up to my knowledge.

If you only have an input layer and an output layer, the graph $G = (V, E)$ is bipartite. The "bi" means you can make two sets of nodes $V_1 \cap V_2 = \emptyset$ with $V_1 \cup V_2 = V$ and all edges $(v_1, v_2) \in E: v_1 \in V_1 \land v_2 \in V_2$.

The more general term is $k$-partite (see Wikipedia). A neural network with $k$ layers (including input and output) is $k$-partite (one also says it is "multipartite").

edit: I've just realized that this is not the exact class you want. The set of all $k$-partite graphs contains all neural networks with $k$ layers, but not only simple multilayer perceptron architectures. It also contains architectures like DenseNets and more. But I guess "$k$-partite directed graph" is as close as you get without saying "multilayer perceptron graph structure" or something similar.

edit: Thanks to Chiel ten Brinke, I've realized that $k=2$ for any layered network (without residual connections). Just put all even-numbered layer nodes in one set and all odd-numbered layer nodes in another set.

Answer 3

For any digraphs $A$ and $B$ a map $f$ is referred to as a full homomorphism from $A$ to $B$ iff there is a homomorphism from $A$ to $B$ satisfying $\small \forall u,v\in V(A)((a,b)\not\in E(A)\implies (f(u),f(v))\not\in E(B))$, this is fairly common notation (e.g. here are several papers using this terminology 1,2,3), so naturally when there exists a full homomorphism from one digraph to another digraph then the first digraph is said to be fully homomorphic to the second one. Now with that said the digraphs you are describing are exactly those that are fully epimorphic to directed paths.

To see why note if any digraph $G=(V,E)$ has a surjective full homomosphism to any directed path $P=(U,R)$ where we have $U=\{1,2,3,\ldots n\}$ and $R=\{(1,2),(2,3),(3,4),\ldots (n-1,n)\}$ then there must exist a surjection $f:\{1,2,3,\ldots n\}\to V$ satisfying $(i,j)\in R\iff (f(i),f(j))\in E$ thus we know $\small E=\{(f(i),f(j)):(i,j)\in R\}=\bigcup_{(i,j)\in R}f^{-1}[\{i\}]\times f^{-1}[\{j\}]=\bigcup_{k=1}^{n-1}f^{-1}[\{k\}]\times f^{-1}[\{k+1\}]$ where $f$ is a surjection and all the fibers $\small \{f^{-1}[\{1\}],f^{-1}[\{2\}],\ldots f^{-1}[\{n\}]\}=\text{coim}(f)$ must partition $V$.