2365 search results - page 123 / 473 » All things are connected |
IPL
2007
15 years 1 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
102
click to vote
ISCI
2007
15 years 1 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
TIT
2008
15 years 1 months ago
2008
For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is chara...
COMBINATORICS
2004
15 years 1 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
IJON
2000
15 years 1 months ago
2000
Models containing recurrent connections amongst the cells within a population can account for a range of empirical data on orientation selectivity in striate cortex. However, exis...