208 search results - page 2 / 42 » The diameter of protean graphs |
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
DAM
2000
14 years 11 months ago
2000
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...
IM
2006
14 years 11 months ago
2006
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
105
click to vote
IM
2007
14 years 11 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
105
click to vote
DM
2002
14 years 11 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...