3268 search results - page 24 / 654 » The hub number of a graph |
DM
2008
13 years 9 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
JGT
2010
13 years 8 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
IICS
2003
Springer
14 years 3 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
JSYML
2008
13 years 9 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
DM
2000
13 years 9 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple