650 search results - page 13 / 130 » Positive graphs |
110
Voted
DAM
2002
15 years 3 months ago
2002
For a positive integer k, a k-subdominating function of a graph G = (V; E) is a function f : V {-1; 1} such that uNG[v] f(u)
221
Voted
GC
2011
Springer
14 years 10 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
141
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
103
click to vote
EJC
2008
15 years 3 months ago
2008
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...
162
click to vote
COCOA
2010
Springer
15 years 1 months ago
2010
Springer
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...