Sciweavers

94 search results - page 1 / 19
» On Regular Factors in Regular Graphs with Small Radius
Sort
View
COMBINATORICS
2004
49views more  COMBINATORICS 2004»
14 years 10 months ago
On Regular Factors in Regular Graphs with Small Radius
Arne Hoffmann, Lutz Volkmann
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
14 years 10 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
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...
Irène Charon, Olivier Hudry, Antoine Lobste...
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
14 years 10 months ago
The Spectral Radius of Subgraphs of Regular Graphs
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...
Vladimir Nikiforov
COMBINATORICS
2007
88views more  COMBINATORICS 2007»
14 years 10 months ago
Maximum Matchings in Regular Graphs of High Girth
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...
Abraham D. Flaxman, Shlomo Hoory
92
Voted
ICASSP
2011
IEEE
14 years 2 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
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...
Meng Sun, Hugo Van hamme