1542 search results - page 36 / 309 » The metamathematics of random graphs |
ISAAC
2009
Springer
15 years 4 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...
120
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...