11381 search results - page 290 / 2277 » Connectivity |
147
click to vote
DM
2006
15 years 6 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
176
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
155
click to vote
JDA
2007
15 years 6 months ago
2007
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a ...
182
click to vote
JGT
2007
15 years 6 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
151
click to vote
CPC
2000
15 years 6 months ago
2000
Abstract. For a nite multigraphG, the reliability function of G is the probability RG(q) that if each edge of G is deleted independently with probability q then the remaining edges...