33 search results - page 3 / 7 » The vertex isoperimetric problem for the powers of the diamo... |
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
FUIN
2006
13 years 8 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
ALGORITHMICA
2006
13 years 8 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
DM
2006
13 years 8 months ago
2006
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
COMBINATORICA
2006
13 years 8 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...