3008 search results - page 80 / 602 » Independence in connected graphs |
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
159
click to vote
STACS
2007
Springer
16 years 13 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
157
click to vote
IANDC
2006
15 years 6 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
165
click to vote
NETWORKING
2008
15 years 7 months ago
2008
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...