• U-COVERING SETS AND U-COVERING POLYNOMIALS OF CHAINS

A. VETHAMANICKAM, K. M. THIRUNAVUKKARASU*

Abstract


Let P be a finite poset. For a subset A of P, the upper cover set of A is defined as U(A) = {xÎP|x covers an aÎA}. The upper closed neighbours of A is defined as U[A]=U(A)  A and A is called an U – covering set of  P  if  U[A] = P.  The U – covering number (P) is the minimum cardinality of a U-covering set. Let   be the family of all U-covering sets of a chain Pn with cardinality i.  Similarly we can define L – covering and N-covering sets of Pn with cordinality i.  (Pn,i) = ||, (Pn, i) = ||, (Pn, i) = ||.  In this paper, we construct , and obtain a recursive formula for U(Pn,i).  Using this recursive  formula   we  construct  the   polynomial  U(Pn,x) = (Pn,i)xi   called  U-covering polynomial of Pn .


Keywords


Poset, U-Covering set, U-Covering 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