The numbers of dependent k-sets in a graph are log ...

Description

Citation

Title The numbers of dependent k-sets in a graph are log concave
Author(s) D. G. C. Horrocks
Journal Journal of Combinatorial Theory Series B
Date 2002
Volume 84
Issue 1
Start page 180
End page 185
Abstract A set of vertices in a graph is said to be dependent if it is not independent. Let p(k)(G) denote the number of dependent sets of size k in the graph G. We show that, for any graph G, the sequence {p(k)(G)} is logarithmically concave. (C) 2001 Elsevier Science.

Using APA 6th Edition citation style.

[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]

Times viewed: 394

Adding this citation to "My List" will allow you to export this citation in other styles.