• VERTEX COVER POLYNOMIAL OF Kn × Kr

B. STEPHEN JOHN*, K. SABITHA MINI

Abstract


The vertex cover Polynomial of a graph G of order n has been already introduced in [3]. It is defined as the polynomial, C (G, i) =, where c (G, i) is the number of vertex covering sets of G of size i and b(G) is the  covering number of G.  In this paper, we derived a formula for finding the vertex cover polynomial of  Kn´ Kr. Aslo we proved that xr - r n  [C(Kn´ Kr, x] is log concave.


Keywords


Vetex covering set, vertex covering number, vertex cover polynomial.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter