IJPAM: Volume 87, No. 6 (2013)

A STUDY ON THE COVERING NUMBER OF
GENERALIZED JAHANGIR GRAPHS $J_{s,m}$

D. Angel$^1$, A. Amutha$^2$
$^{1,2}$Department of Mathematics
Sathyabama University
Chennai, 119, INDIA


Abstract. A set $S$ of vertices of a graph $G = (V, E)$ is called a vertex cover, if each edge in E has at least one end point in $S$ and the minimum cardinality taken over all vertex covering sets of $G$ is called the covering number of $G$ denoted by $\beta(G)$. In this paper, we study some results on vertex covering, edge covering, strong and weak covering, and inverse covering numbers denoted by $\beta(G)$, $\beta^\prime(G)$, $s\beta(G)$, $w\beta(G)$, $\beta^{-1}(G)$ respectively for generalized Jahangir graphs $J_{s,m}$. 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
Year: 2013
Volume: 87
Issue: 6