Abstract
A directed graph can be described as a list of ordered pairs of positive integers denoting the edges the integers denote the vertices But a pair of integers can be collapsed into a unique single integer using a pairing function Moreover this transformation of a pair can be inverted This means that a directed graph can be uniquely described by a single integer obtained by a converting the ordered p
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
