3008 search results - page 33 / 602 » Independence in connected graphs |
173
click to vote
SIAMDM
2010
15 years 27 days ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
175
click to vote
DM
2008
15 years 6 months ago
2008
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
145
click to vote
DAM
2002
15 years 6 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
160
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
164
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...