http://ijmsc.com/index.php/ijmsc/issue/feedInternational Journal of Mathematics and Soft Computing2017-08-27T12:56:09+00:00P. Selvagopaleditor@ijmsc.comOpen Journal Systems<p style="font-family: arial; color: black; font-size: 14px;">The International Journal of Mathematics and Soft Computing (IJMSC) is published twice a year (both printed and online version). The journal is devoted to publish research articles in the field of Mathematics and Soft Computing. This is a broad-based journal covering wide spectrum of topics in all branches of Pure Mathematics ( Topology, Algebra, Real and Complex analysis, Functional analysis, differential equations, difference equations, …) and Applied Mathematics (graph theory, graph algorithms, combinatorics, discrete mathematics, discrete optimization, …), Computational mathematics and Soft Computing(Fuzzy systems, Neural network. Cryptology, Chaos theory, Genetic algorithm, …).</p><p style="font-family: arial; color: blue; font-size: 14px;"><strong><strong><br /></strong></strong></p><p style="font-family: arial; color: blue; font-size: 14px;"><strong><strong>International Journal of Mathematics and Soft Computing (IJMSC) is included in the UGC Approved list of Journals...Journal No: 63448</strong></strong></p><div style="font-family: arial; color: red; font-size: 12px;"><strong><strong>Search Title by IJMSC<a href="http://www.ugc.ac.in/journallist/" target="_blank"> http://www.ugc.ac.in/journallist/</a></strong></strong></div><div style="font-family: arial; color: red; font-size: 12px;"><strong><strong>Or Search by ISSN</strong></strong></div><p style="font-family: arial; color: blue; font-size: 14px;"><strong>Cosmos Impact Factor: 5.120, Universal Impact Factor: 28.4587, ICV: 68.58</strong></p>http://ijmsc.com/index.php/ijmsc/article/view/ijmsc-7-2-10Neighborhood-prime labeling of some generalized Petersen graphs2017-08-27T12:56:09+00:00S K Patelskpatel27@yahoo.com<p>Let $G=(V(G),E(G))$ be a graph with $n$ vertices and for $v \in V(G)$, let $N(v)$ denote the open neighborhood of $v$. A bijective function $ f:V(G)\to \left\{1, 2, 3, \dots ,n\right\}$ is said to be a neighborhood-prime labeling <br />of $G$, if for every vertex $v \in V(G)$ with $deg (v) > 1$, $gcd\left\{f(u): u\in N(v)\right\}=1.$ A graph which admits neighborhood-prime labeling is called a neighborhood-prime graph and if in a graph $G,$ every vertex is of degree at most $1,$ then such a graph is neighborhood-prime vacuously. In this paper, we show that the generalized Petersen graph $P(n,k)$ is neighborhood-prime when the greatest common divisor of $n$ and $k$ is $1, 2$ or $4$ and we also show that $P(n,8)$ is neighborhood-prime for all $n$.</p>2017-08-27T00:00:00+00:00Copyright (c) 2017 International Journal of Mathematics and Soft Computing