97 search results - page 2 / 20 » Cycles, Paths, Connectivity and Diameter in Distance Graphs |
ITCC
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
DM
2007
13 years 5 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
SIGMETRICS
2006
ACM
13 years 11 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
DM
2010
13 years 5 months ago
2010
CCCG
2004
13 years 7 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...