779 search results - page 41 / 156 » A graph polynomial for independent sets of bipartite graphs |
117
click to vote
DM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
176
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
119
click to vote
ARSCOM
1998
15 years 5 months ago
1998
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
161
click to vote
COCOON
2007
Springer
16 years 9 days ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...