𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the upper bound of the diameter of interchange graphs

✍ Scribed by Jianguo Qian

Book ID
108316288
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
308 KB
Volume
195
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On distance two graphs of upper bound gr
On distance two graphs of upper bound graphs
✍ Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 190 KB
Decreasing the diameter of bounded degre
Decreasing the diameter of bounded degree graphs
✍ Noga Alon; AndrΓ‘s GyΓ‘rfΓ‘s; MiklΓ³s RuszinkΓ³ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views
Disjoint Cycles in Eulerian Digraphs and
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
✍ Richard A. Brualdi; Jian Shen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 87 KB

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

New upper bounds on the decomposability
New upper bounds on the decomposability of planar graphs
✍ Fedor V. Fomin; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 335 KB πŸ‘ 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant Ξ±. We give a proof of the best, so far, upper bound for the constant Ξ±. In particular, for th