𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path connectivity of k-generalized projectors

✍ Scribed by Hong-Ke Du; Wen-Feng Wang; Ying-Tao Duan


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
156 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An alternative characterization of gener
✍ Jerzy K Baksalary; Xiaoji Liu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 164 KB

One of the results of Groß and Trenkler [Linear Algebra Appl. 264 (1997) 463] asserts that a square complex matrix K is a generalized projector if and only if it is (i) quadripotent, (ii) normal, and (iii) partial isometry. The authors supplemented this statement by proving that condition (iii) in t

Connectivity keeping paths in k-connecte
✍ W. Mader πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 1 views

## Abstract A result of G. Chartrand, A. Kaugars, and D. R. Lick [Proc Amer Math Soc 32 (1972), 63–68] says that every finite, k‐connected graph __G__ of minimum degree at least ⌊3__k__/2βŒ‹ contains a vertex __x__ such that __G__βˆ’__x__ is still __k__‐connected. We generalize this result by proving t

Paths in k-edge-connected graphs
✍ Haruko Okamura πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 562 KB