Sciweavers

208 search results - page 1 / 42
» The diameter of protean graphs
Sort
View
DM
2008
81views more  DM 2008»
13 years 4 months ago
The diameter of protean graphs
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...
Pawel Pralat
COCOA
2008
Springer
13 years 6 months ago
Protean Graphs with a Variety of Ranking Schemes
The World Wide 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 an...
Pawel Pralat
DM
2011
264views Education» more  DM 2011»
12 years 11 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide 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 an...
Pawel Pralat
JCT
2010
95views more  JCT 2010»
13 years 3 months ago
Oriented diameter of graphs with diameter 3
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
Peter K. Kwok, Qi Liu, Douglas B. West
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
13 years 4 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
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...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...