On (d,k)-Independence Numbers of Hypercube Network
  
Key Words: （d   k）-independence number   hypercube   distance   wide-distance   wide-diameter.  
Fund Project:
Author NameAffiliation
XIE Xin Dept. of Math.
Huangshan College
Anhui
China 
XU Jun-ming Dept. of Math.
University of Science and Technology of China
China 
Hits: 2500
Download times: 1268
Abstract:
      The (d,k)-independence number of a connected graph G is an important parameter for analysing performance of interconnection networks. It has been proved to be an NPC problem to determine the exact value of (d,k)-independence number of any graph for given
Citation:
DOI:10.3770/j.issn:1000-341X.2005.04.021
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.