3268 search results - page 303 / 654 » The hub number of a graph |
376
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
174
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
163
click to vote
DM
2010
15 years 6 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
204
click to vote
JCT
2007
15 years 6 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
179
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...