94 search results - page 1 / 19 » On Regular Factors in Regular Graphs with Small Radius |
COMBINATORICS
2004
14 years 10 months ago
2004
COMBINATORICS
2002
14 years 10 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
COMBINATORICS
2007
14 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) Let G be a regular graph of order n and finite di...
COMBINATORICS
2007
14 years 10 months ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
92
Voted
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...