Abstract : To maintain network reliability and performance, it must be protected against two common problems; link and node failures. Network protection codes (NPC) were proposed to protect operational networks against these failures, where encoding and decoding operations of such codes were developed over binary and finite fields. Finding network topologies, practical scenarios, and limits on graphs applicable for NPC are of interest. In this paper, we investigate a new method to represent the network coding topology. This method is equivalent to the conventional representation used, but it is more easier. This method on the contrary of the conventional representation can be extended for larger networks and can be used efficiently to prevent data losses. Several applications such as security and multicast can also make use of this method. Keywords: Network coding; The G-method.