%0 Journal Article
%A JIN Jing-Jing
%T Distance Properties of a Class of Interchange Graph
%D 2012
%R 10.3969/j.issn.1007-2985.2012.04.007
%J Journal of Jishou University(Natural Sciences Edition)
%P 31-36
%V 33
%N 4
%X 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.
%U https://zkxb.jsu.edu.cn/EN/10.3969/j.issn.1007-2985.2012.04.007