๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On graph compatible Splittings of M-matrices

โœ Scribed by Mou-Cheng Zhang

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
139 KB
Volume
91
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On clique partitions of split graphs
On clique partitions of split graphs
โœ W.D. Wallis; J. Wu ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

Parsons graphs of matrices on Lpn
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