Encoding Vertices in Rectangular Grid Graphs with Eliminating Errors

Abstract

An undirected graph G = (V,E) where V is a set of vertices and E =V ×V is the set of pair of adjacent edges or in other words it is the set of edges. In theory, a graph can be a model of a message delivery in a network. We assume that the computer network has a particular shape which we call as a rectangular grid and there is a computer on each vertex in the graph. Each vertex v∈V is labelled by a subset of universal set U that models the header of a message sent between two distinct computers in G. We present a way to encode routes in the graph G by encoding all distinct vertices u,v ∈V in the routes. We aim that these codes prevent errors denoted by false positives, therefore, results in a more efficient use of network resources.