We consider the problem of constructing a matrix with prescribed row and Γ 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is
Switching classes of directed graphs and H-equivalent matrices
β Scribed by Ying Cheng
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 781 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we define and study the switching classes of directed graphs. The definition is a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. We actually do it in a general way so that Wells" signed switching classes of graphs are special cases. As an application, we obtain a formula for the number of H-equivalence classes of matrices of fixed size whose entries are chosen from {1, -1, 2, -2 .... , k, -k}.
π SIMILAR VOLUMES
A by-inspection analysis and synthesis method for multiphase switched-current (SI) circuits using signal-flow graph (SFG) techniques is presented. The SFG is derived on the transistor level and the method is primarily useful for the hand analysis and design of small and medium-size SI circuits (e.g.
Let u be a positive integer and Z, the residue class ring modulo U. Two subsets D1 and D, of Z, are said to be equivalent if there exist t,seZ, with gcd(t, v)= 1 such that D, = tD, +s. We are interested in the number of equivalence classes of k-subsets of 2, and the number of equivalence classes of