534 search results - page 2 / 107 » Diameter critical graphs |
78
Voted
IPL
2007
15 years 16 days ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
87
Voted
ALGORITHMICA
2004
15 years 15 days ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
COMBINATORICS
2000
15 years 13 days ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
100
Voted
DM
2008
15 years 21 days ago
2008
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
85
Voted
COMBINATORICS
1998
15 years 9 days ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...