Name
Abstract | ||
|---|---|---|
It was shown before that ifG is a graph of maximum degreep containing no cliques of the sizeq then the independence ratio is greater than or equal to 2 / (p +q). We shall discuss here some extreme cases of this inequality. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1007/BF02579154 | Combinatorica |
Keywords | Field | DocType |
maximum degree | Discrete mathematics,Graph,Combinatorics,Clique,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
4 | 1 | 1439-6912 |
Citations | PageRank | References |
10 | 1.93 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siemion Fajtlowicz | 1 | 93 | 26.12 |