3008 search results - page 17 / 602 » Independence in connected graphs |
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
108
click to vote
WAW
2007
Springer
15 years 6 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
107
Voted
DM
2008
15 years 22 days ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
106
Voted
ORL
2008
15 years 18 days ago
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
119
Voted
COLOGNETWENTE
2007
15 years 2 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...