3008 search results - page 1 / 602 » Independence in connected graphs |
CORR
2007
Springer
13 years 5 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...
DAM
2011
13 years 8 days 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...
JETAI
1998
13 years 5 months 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...
IPCO
2001
13 years 6 months ago
2001
DM
2000
13 years 5 months ago
2000
For integers p; q; s with p