3008 search results - page 138 / 602 » Independence in connected graphs |
175
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
177
click to vote
EICS
2009
ACM
16 years 28 days ago
2009
ACM
Discovering and unlocking the full potential of complex pervasive environments is still approached in application-centric ways. A set of statically deployed applications often de�...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
143
click to vote
ENTCS
2008
15 years 6 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
187
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...