3008 search results - page 1 / 602 » Independence in connected graphs |
117
Voted
CORR
2007
Springer
15 years 18 days 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...
118
Voted
DAM
2011
14 years 7 months ago
2011
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...
96
Voted
JETAI
1998
15 years 9 days ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
88
Voted
IPCO
2001
15 years 2 months ago
2001
86
Voted
DM
2000
15 years 13 days ago
2000
For integers p; q; s with p