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
Diameter vulnerability of iterated line digraphs in terms of the girth
β Scribed by C. Balbuena; X. Marcote; D. Ferrero
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 114 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper presents a highly stable relaxation iterative algorithm for solving the ionized fields of unipolar HVDC transmission lines in the absence or in the presence of wind. The finite element method is employed to solve Poisson's equation, and the upwind finite volume method is applied to solve
## Abstract Hip resurfacing arthroplasty has become a popular alternative to conventional hip surgery. Surface replacements with bearing sizes of 55 mm (__n__ = 5) and 39 mm (__n__ = 5) were tested in a hip simulator for 15 million cycles (Mc). Wear debris was isolated from the serum lubricant and