FINDING THE PATH CENTRE OF A COMMUNICATIONS NETWORK


DÜNDAR P. , KILIÇ E. , BALCI M. A.

NEURAL NETWORK WORLD, cilt.19, ss.725-733, 2009 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 19 Konu: 6
  • Basım Tarihi: 2009
  • Dergi Adı: NEURAL NETWORK WORLD
  • Sayfa Sayıları: ss.725-733

Özet

The centre of a communications network is a vertex set. The distances between every vertex in the centre set and all other vertices of the network are minimal. In some cases, the centre of the network can be a path, which includes a desired number of vertices. This centre is called a path centre of the network. In this paper, we aim to find a path centre of a given network with the needed number of vertices. We give the distance measures of the network and represent an algorithm searching the path centre of the network.