In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...

We generalize in various directions a result of Friedland and Karlin on a lower bound for the spectral radius of a matrix that is positively diagonally equivalent to a • The research of these authors was supported by their joint grant No. 90-00434 from the United States-Israel Binational Science Foundation, Jerusalem, Israel. t The research of this author was supported in part by NSF Grant DMS-...

The polytope Q, of the convex combinations of the permutation matrices of order n is well known (Birkhoff’s theorem) to be the polytope of doubly stochastic matrices of order n. In particular it is easy to decide whether a matrix of order n belongs to Q,. . check to see that the entries are nonnegative and that all row and columns sums equal 1. Now the permutations z of { 1, 2, . . . . n} are i...

Doubly stochastic measures are Borel probability measures on the unit square which push forward via the canonical projections to Lebesgue measure on each axis. The set of doubly stochastic measures is convex, so its extreme points are of particular interest. I review necessary and sufficient conditions for a set to support an extremal doubly stochastic measure, and include a proof that such a s...