148 search results - page 4 / 30 » Sums of powers of the degrees of a graph |
ARSCOM
2007
13 years 8 months ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
—We demonstrate that receive antenna selection (RAS) provides significant increase in the achievable sum rates for multi-user MIMO wireless downlinks that employ block diagonaliz...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
COMBINATORICS
1998
13 years 8 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...