Some properties of a class of interchange graphs

DOI10.1007/s11766-998-0059-6zbMath0971.05077OpenAlexW2041496591MaRDI QIDQ1288225

Jumin Xiang, Jian Guo Qian

Publication date: 30 October 2001

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0059-6

zbMATH Keywords

diameterconnectivitytransitivityinterchange graphJohnson scheme graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

On the upper bound of the diameter of interchange graphs

Cites Work

• The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
• Matrices of zeros and ones with fixed row and column sum vectors
• Small diameter interchange graphs of classes of matrices of zeros and ones
• On the uniqueness of the graphs G(n,k) of the Johnson schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some properties of a class of interchange graphs