3268 search results - page 61 / 654 » The hub number of a graph |
180
click to vote
APSEC
2005
IEEE
15 years 11 months ago
2005
IEEE
The scale-free network shown in the small world phenomenon indicates that our human society consists of a small number of people who play the role of hubs linked with many nodes (...
167
click to vote
CCCG
2010
15 years 7 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
140
click to vote
JCT
2008
15 years 6 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
180
click to vote
EJC
2006
15 years 6 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
141
click to vote
RSA
2000
15 years 6 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...