On the vertex covering sets and vertex cover polynomials of square of ladder graph. (3rd March 2016)

• Record Type: Journal Article
• Authors: Vijayan, A.; Ida Helan, T. S.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 347
• Page End: 360
• Publication Date: 2016-03-03
• Subjects: square of ladder graph -- vertex covering set -- vertex covering number -- vertex covering polynomial; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1101884
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Let G be a graph of order n with no isolated vertex. A vertex covering of the graph G is a set of vertices such that every edge of the graph is incident to atleast one vertex of the set. Let C ( G, i ) be the family of vertex covering sets in G with cardinality ' i ' and let c ( G, i ) = | C ( G, i ) |. The polynomial is called the vertex cover polynomial of G . In this paper, we obtain some properties of vertex cover polynomials of . Also, we derive the reduction formula to calculate the vertex covering polynomials of .