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

Detecting morphic images of a word on the rank of a pattern

โœ Scribed by Jean Neraud

Book ID
118772324
Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
637 KB
Volume
32
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Low rank perturbations and the spectrum
Low rank perturbations and the spectrum of a tridiagonal sign pattern
โœ L. Elsner; D.D. Olesky; P. van den Driessche ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

The n-by-n tridiagonal sign pattern T n has every superdiagonal entry positive, every subdiagonal entry negative, the (1, 1) entry negative, the (n, n) entry positive and every other diagonal entry zero. Inertia and spectral results for matrices A n having the sign pattern T n are proved using new t

On the rank of a cograph
On the rank of a cograph
โœ Gerard J. Chang; Liang-Hao Huang; Hong-Gwa Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 89 KB

The rank of a graph is defined to be the rank of its adjacency matrix. Royle [G.F. Royle, The rank of a cograph, Electron. J. Combin. 10 (2003) #N11] proved a somewhat surprising result that the rank of a cograph is equal to the number of distinct non-zero rows of its adjacency matrix. In this paper