1591 search results - page 1 / 319 » Random lifts of graphs |
EJC
2006
13 years 9 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
RSA
2010
13 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
SIAMDM
2008
13 years 9 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
SODA
2001
ACM
13 years 11 months ago
2001
ACM
CPC
2010
13 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...