Disjoint cycles in Eulerian diagraphs and the diameter of interchange graphs

  • Brualdi R
  • Shen J
  • 7


    Mendeley users who have this article in their library.
  • 7


    Citations of this article.


Let R = (r1,...,rm) and S=(s1,...,sn) be nonnegative integral vectors with ∑ ri= ∑ sj. Let A(R,S) denote the set of all m × n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ≠ ∅. The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by an interchange matrix. Brualdi conjectured that the diameter of G(R, S) cannot exceed mn/4. A digraph G = (V, E) is called Eulerian if, for each vertex u ε V, the out-degree and indegree of u are equal. We first prove that any bipartite Eulerian digraph with vertex partition sizes m, n, and with more than (√17-1) mn/4 (≈0.78mn) arcs contains a cycle of length at most 4. As an application of this, we show that the diameter of G(R, S) cannot exceed (3+√17) mn/16 (≈0.445mn). The latter result improves a recent upper bound on the diameter of G(R, S) by Qian. Finally, we present some open problems concerning the girth and the maximum number of arc-disjoint cycles in an Eulerian digraph. © 2002 Elsevier Science (USA).

Author-supplied keywords

  • Arc-disjoint cycles
  • Diameter
  • Eulerian digraph
  • Girth
  • Interchange graph
  • {0,1}-matrix row (column) sum vector

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free