Loading...

Chromatic sets of power graphs and their application to resource placement in multicomputer networks

Imani, N ; Sharif University of Technology | 2009

340 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.camwa.2009.01.043
  3. Publisher: 2009
  4. Abstract:
  5. In this paper, using the chromatic properties of power graphs we propose a new approach for placing resources in symmetric networks. Our novel placement scheme guarantees a perfect placement when such a solution is feasible in the topology, while in general it answers the question of k-resource placement at a distance d where each non-resource node is able to access k resource nodes within at most d hops away. We define a quasi-perfect graph as a graph whose clique number and chromatic number are equal. We derive important properties of quasi-perfect graphs and use them to find a solution for the resource placement problem. We have also applied the proposed method to find a distant resource placement in the popular hypercube network as an example. We have also considered the problem of sparse resource placement. © 2009 Elsevier Ltd. All rights reserved
  6. Keywords:
  7. Power graphs ; Resource placement ; Sparse placement ; Symmetric graphs ; Chromatic number ; Hypercube ; Power graphs ; Geometry ; Interconnection networks ; Telecommunication networks ; Graph theory
  8. Source: Computers and Mathematics with Applications ; Volume 58, Issue 3 , 2009 , Pages 403-413 ; 08981221 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0898122109003198