On ranking and unranking labeled digraphs

Authors:

• Zbigniew Palka

Abstract

In this paper a problem of ranking and unranking labeled digraphs is considered. As a consequence we obtain a simple representation of such graphs by integers. These integers can be also used to define a complexity measure of considering objects. For a given digraph we define its vertex-rank code. The position of such code in a given total ordering gives the representation of the digraph. This approach allows easily to decode the structure of a digraph from an integer being its representation.