922 search results - page 153 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
117
click to vote
DAM
2010
15 years 2 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
DM
2008
15 years 2 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
156
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
112
click to vote
COMBINATORICS
2006
15 years 2 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
105
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...