A NOTE ON USELESS COMMUNICATION CHANNELS AND DIRECTED GRAPHS
E.A. Gonzalez, T.A. Ronquillo · International Journal of Pure and Apllied Mathematics · 2014
The purpose of this note is to give an idea for graph theorists to explore a connection between communication channels and graph theory as indicated in our conjectures below. DefinitionsFrom this point, we define graph as follows:Definition 1.A graph is said to be super complete of order n, i.e.K n , if and only if 1. the graph is K n complete [1]; 2. each vertex of K n contains a loop; and