2079 search results - page 19 / 416 » Universality of random graphs |
65
Voted
MSCS
2002
15 years 1 months ago
2002
101
click to vote
JCB
2006
15 years 1 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
109
click to vote
CSR
2008
Springer
15 years 3 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
101
click to vote
EJC
2006
15 years 1 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
123
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...