On the upper bound of the diameter of interchange graphs

DOI10.1016/S0012-365X(98)00187-3zbMath0928.05042MaRDI QIDQ1296994

Jian Guo Qian

Publication date: 9 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper bound\((0,1)\)-matricesinterchange graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

On realization graphs of degree sequences ⋮ Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

Cites Work

• Chromatic number of classes of matrices of zeros and ones
• 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
• Some properties of a class of interchange graphs
• Hamiltonicity of a type of interchange graphs
• Small diameter interchange graphs of classes of matrices of zeros and ones
• Properties of a Class of (0,1)-Matrices Covering a given Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the upper bound of the diameter of interchange graphs