236 search results - page 2 / 48 » Graphs, partitions and Fibonacci numbers |
GFKL
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
SOFSEM
2005
Springer
13 years 11 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
DM
2000
13 years 6 months ago
2000
For integers p; q; s with p
ARSCOM
2004
13 years 6 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
SIAMCOMP
2002
13 years 5 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...