Dr.Geetha is working as an Assistant Professor in the Department of Mathematics from 2007. She has a vast teaching experience of 18 years  (including Amrita) serving in various colleges in Karnataka that includes the experience in National Institute of Technology, Surathkal.She has obtained her Doctorate degree from Visvesvaraya Technological University, Belgaum in the year 2014. Her areas of interest are Discrete Mathematics and Graph Theory.


Degree University Year
Ph.D.(Graph Theory) VTU, Belgaum 2014
M.Sc. Mathematics Bangalore University 1997
B.Sc.  Bangalore University 1995


Publication Type: Journal Article
Year of Publication Publication Type Title
2015 Journal Article N. Na Swamy, Sooryanarayana, Bb, Swamy, G. KcNanjunda, and N, G. K., “Open neighborhood chromatic number of an antiprism graph”, Applied Mathematics E - Notes, vol. 15, pp. 54-62, 2015.[Abstract]

<p>An open neighborhood k-coloring of a simple connected undirected graph G(V,E) is a k-coloring c: V → {1, 2, …, k}, such that, for every w ∈ V and for all u, v ∈ N(w), c(u) ≠ c(v). The minimum value of k for which G admits an open neighborhood k-coloring is called the open neighborhood chromatic number of G denoted by χonc(G). In this paper, we obtain the open neighborhood chromatic number of the Petersen graph. Also, we determine this number for a family of graphs called antiprism graphs. © 2015, Applied Mathematics E-Notes.</p>

More »»
2014 Journal Article G. K. N, Meera, K. N., Swamy, N. Narasimha, and Sooryanarayana, B., “Open Neighborhood Coloring of Prisms”, Journal of Mathematical and Fundamental Sciences, vol. 45, pp. 245–262, 2014.[Abstract]

For a simple, connected, undirected graph G(V, E) an open neighborhood coloring of the graph G is a mapping f : V (G) --> Z+ such that for each w in V(G), and for all u, v in N(w), f(u) is different from f(v). The maximum value of f(w), for all w in V (G) is called the span of the open neighborhood coloring f. The minimum value of span of f over all open neighborhood colorings f is called open neighborhood chromatic number of G, denoted by Xonc(G). In this paper we determine the open neighborhood chromatic number of prisms.

More »»
2014 Journal Article B. Sooryanarayana and N, G. K., “On the k-Metric Dimension of Graphs”, Journal of Mathematics and Computational Science, vol. 4, no. 5, pp. 861–878, 2014.[Abstract]

Let G(V,E) be a connected graph. A subset S of V is said to be k-resolving set of G, if for every pair of distinct vertices u, v ∈/ S, there exists a vertex w ∈ S such that |d(u,w)−d(v,w)| ≥ k, for some k ∈ Z +. Among all k-resolving sets of G, the set having minimum cardinality is called a k-metric basis of G and its cardinality is called the k-metric dimension of G and is denoted by βk(G). In this paper, we have discussed some characterizations of k-metric dimension in terms of some graphical parameters. We have mainly focused on 2-metric dimension of graphs and discussed few characterizations. Further 2-metric dimension of trees is determined and from this result 2- metric dimension of path, cycle and sharp bounds of unicyclic graphs are established

More »»
2013 Journal Article G. K. N, Meera, K. N., N, N., and Sooryanarayana, B., “Open neighborhood coloring of graphs”, International journal of contemporary mathematical sciences, vol. 8, pp. 13–16, 2013.

Faculty Details


Faculty Email: