1199 search results - page 42 / 240 » Graph Theory |
128
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
114
click to vote
DM
2010
15 years 2 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
149
Voted
RSA
2010
15 years 1 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
115
click to vote
COMBINATORICA
2004
15 years 2 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
110
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...