4865 search results - page 121 / 973 » The Complexity of Graph Connectivity |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
MLG
2007
Springer
14 years 4 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
EMMCVPR
2009
Springer
14 years 2 months ago
2009
Springer
Complex diffusion was introduced in the image processing literature as a means to achieve simultaneous denoising and enhancement of scalar valued images. In this paper, we present ...
COMBINATORICS
2007
13 years 10 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
COMBINATORICA
2000
13 years 10 months ago
2000
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...