✦ LIBER ✦

Parsons graphs of matrices

✍ Scribed by Joseph Zaks

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 628 KB
Volume: 78
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90176-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parsons graphs of matrices on Lpn

✍ Zhaoji Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Let R be a finite commutative ring with q elements, d an even integer, and SLd(R) the special linear group on R of dimension d. For any b in R, let Tb(d,q) denote the following graph: (1) V = V(Tb(d,q)) = SLd(R), that is the collection of all the d x d matrices A over R for which det(A) = 1. (2) E

Quasi-abelian cayley graphs and parsons

Quasi-abelian cayley graphs and parsons graphs

✍ Jun Wang; Ming-Yao Xu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Unimodular Matrices and Parsons Numbers

✍ Aiden Bruen; David Wehlau; Zhang Zhaoji 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Let [A 1 , ..., A m ] be a set of m matrices of size n\_n over the field F such that A i # SL(n, F) for 1 i m and such that A i &A j # SL(n, F) for 1 i< j m. The largest integer m for which such a set exists is called the Parsons number for n and F, denoted m(n, F). We will call such a set of m(n, F

Graphs and nonnegative matrices

✍ R.J. Plemmons 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Bipartite graphs obtained from adjacency

Bipartite graphs obtained from adjacency matrices of orientations of graphs

✍ K.B. Reid 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 630 KB

If G denotes a graph of order n, then the adjacency matf;ix of an orientation G of G can be thought of as the adjacency matrix of a bipartite graph B(G) of order 2n, where the rows and columns correspond to the bipartition of B(G). For agraph H, let k(H) denote the number of connected components of

Realization of Matrices and Directed Gra

Realization of Matrices and Directed Graphs

✍ Rajeev Motwani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

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