41 search results - page 3 / 9 » Expansion Properties Of Levi Graphs |
JSYML
2010
14 years 4 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
DAM
2007
14 years 9 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...