On the number of dependent sets in a connected graph
Description
Citation
| Title | On the number of dependent sets in a connected graph |
| Author(s) | D. Horrocks |
| Journal | Ars Combinatoria |
| Date | 1999 |
| Volume | 53 |
| Issue | |
| Start page | 239 |
| End page | 247 |
| Abstract | A set X of vertices of a graph is said to be dependent if X is not an independent set. For the graph G, let P-k(G) denote the set of dependent sets of cardinality k. In this paper, we show that if G is a connected graph on 2n vertices where n greater than or equal to 3 then \P-n(G)\ greater than or equal to \Pn+1(G)\. This study is motivated by a conjecture of Lih. |
| ISSN | 0381-7032 |
Using APA 6th Edition citation style.
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Times viewed: 80
