1632 search results - page 14 / 327 » On special numberings of hypergraphs |
152
click to vote
DM
2010
15 years 6 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
190
click to vote
DM
2002
15 years 5 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
157
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
163
click to vote
FOCI
2007
IEEE
16 years 10 days ago
2007
IEEE
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
149
click to vote
JGT
2008
15 years 6 months ago
2008
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...