MODELS DEVELOPMENT FOR SINGLE–ROW NETWORKS FROM CONNECTED GRAPHS

In this paper, we present a collection of models for connected graphs mapping into single–row networks. the collection involves three specific models for perfect binary trees, trees and partially dense graphs, and three general models for connected graphs. these models are compared in terms of their structures, energy values, congestion and number of doglegs in the single–row transformation. the numerical experiments are run by each respective developed program. the transformation is necessary in applications such as in the assignment of telephone channels to caller–receiver pairs roaming in cells in a cellular network on real–time basis.