723 search results - page 22 / 145 » On the hyperbolicity constant in graphs |
154
click to vote
DM
2008
15 years 6 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
174
click to vote
IV
2005
IEEE
15 years 11 months ago
2005
IEEE
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...
262
click to vote
GC
2011
Springer
15 years 1 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
140
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...