2304 search results - page 145 / 461 » On the Vulnerability of Large Graphs |
149
click to vote
ESA
2009
Springer
16 years 24 days ago
2009
Springer
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
144
click to vote
WAW
2007
Springer
16 years 10 days ago
2007
Springer
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank ...
178
Voted
IICS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract: The article presents a model of the structural properties of virtual communities and the information they can access. It argues that a large part of the information – a...
166
Voted
COMBINATORICA
2006
15 years 6 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
171
click to vote
COMBINATORICA
1998
15 years 6 months ago
1998
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...