journal6 ›› 2012, Vol. 33 ›› Issue (4): 31-36.DOI: 10.3969/j.issn.1007-2985.2012.04.007

• Mathematics • Previous Articles     Next Articles

Distance  Properties of a Class of  Interchange Graph


  1. (Fujian Chuanzheng Communications College,Fuzhou 350007,Fujian China)
  • Online:2012-07-25 Published:2012-09-11

Abstract: The diameter of G(RS*)   is r,where R*=(r1,r2),S*=(1,…,1),and it comes to a conclusion that for any two vertices of G(R*,S*) with distance k,there are exactly k2 internally-disjoint paths connecting them and that there are at most r1  n-r1 internally-disjoint paths connecting them.

Key words: interchange , graph;(0,1)-matrix;vector;diameter;distance

WeChat e-book chaoxing Mobile QQ