Definition:Underlying Graph

Definition
Let $N = \left({V, E, f}\right)$ be a network where $f: E \to \R$ is the mapping from the edge set $E$ to the real numbers $\R$.

The underlying graph of $N$ is the graph $G = \left({V, E}\right)$ consisting only of the vertex set $V$ and the edge set $E$.