UNICONTOUR ISOMORPHIC FACTORIZATIONS OF DE BRUIJN AND KAUTZ DIGRAPHS

    loading  Checking for direct PDF access through Ovid

Abstract

In the topology of information networks, problems arise of existence and implementation of a decomposition of some network into factor-graphs that have no common edges and to which certain specified features are assigned. Special attention is given to isomorphic expansions and factorizations of graphs in the case where obtained components are simplest topologic network structures. The factorized character of Bruijn and Kautz graphs on a set of specific families of unicontour oriented factors is proved.

Related Topics

    loading  Loading Related Articles