𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic connectivity and doubly stochastic tree matrices

✍ Scribed by Xiao-Dong Zhang

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
137 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spanning tree invariants, loop systems a
Spanning tree invariants, loop systems and doubly stochastic matrices
✍ Ricardo GΓ³mez; JosΓ© Miguel Salazar πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 260 KB

The spanning tree invariant of Lind and Tuncel [12] is observed in the context of loop systems of Markov chains. For n = 1, 2, 3 the spanning tree invariants of the loop systems of a Markov chain determined by an irreducible stochastic (n Γ— n)-matrix P coincide if and only if P is doubly stochastic

Vertex degrees and doubly stochastic gra
Vertex degrees and doubly stochastic graph matrices
✍ Xiao-Dong Zhang πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 119 KB

In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graph matrix and investigate the relations between a kind of distance for gr

The ordering of trees and connected grap
The ordering of trees and connected graphs by algebraic connectivity
✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with Ξ±(P n ) < Ξ±(Q n ) < Ξ±(W n ) < Ξ±(Z n ) < Ξ±(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L