Name
Abstract | ||
|---|---|---|
We give an upper bound on the independence number of the cube of the odd cycle C8n+5. The best known lower bound is conjectured to be the truth; we prove the conjecture in the case 8n + 5 prime and, within 2, for general n. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | lower bound,shannon capacity,independent set,graph power,upper bound |
Field | DocType | Volume |
Prime (order theory),Discrete mathematics,Combinatorics,Independence number,Graph power,Upper and lower bounds,Conjecture,Channel capacity,Mathematics,Cube | Journal | 20.0 |
Issue | ISSN | Citations |
3.0 | 1077-8926 | 2 |
PageRank | References | Authors |
0.48 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Ron Holzman | 2 | 287 | 43.78 |
| Venkatesh Natarajan | 3 | 7 | 1.39 |