Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
The Binding Number Of A Graph And Its Cliques, Jeremy Lyle, Wayne Goddard
The Binding Number Of A Graph And Its Cliques, Jeremy Lyle, Wayne Goddard
Faculty Publications
We consider the binding numbers of K(r)-free graphs, and improve the upper bounds on the binding number which force a graph to contain a clique of order r. For the case r = 4, we provide a construction for K(4)-free graphs which have a larger binding number than the previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets. (C) 2009 Elsevier B.V. All rights reserved.