IJPAM: Volume 87, No. 6 (2013)
GENERALIZED JAHANGIR GRAPHS
Department of Mathematics
Chennai, 119, INDIA
Abstract. A set of vertices of a graph is called a vertex cover, if each edge in E has at least one end point in and the minimum cardinality taken over all vertex covering sets of is called the covering number of denoted by . In this paper, we study some results on vertex covering, edge covering, strong and weak covering, and inverse covering numbers denoted by , , , , respectively for generalized Jahangir graphs . We have also characterized the graphs which are invertible.
Received: September 6, 2013
AMS Subject Classification: 05C70
Key Words and Phrases: vertex cover, edge cover, inverse cover, strong cover and generalized Jahangir graphs
Download paper from here.
DOI: 10.12732/ijpam.v87i6.12 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395