Sciweavers

3268 search results - page 107 / 654
» The hub number of a graph
Sort
View
WG
1994
Springer
15 years 10 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
PR
2008
206views more  PR 2008»
15 years 6 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
ICIP
2002
IEEE
16 years 8 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie
IM
2007
15 years 6 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 6 months ago
On Packing Colorings of Distance Graphs
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
Olivier Togni