 Qualification:
Ph.D, MPhil, MSc
kn_meera@blr.amrita.edu
Phone:
9449153772

Dr. K. N. Meera currently serves as Assistant Professor (SG) at the department of Mathematics, Amrita School of Engineering, Bengaluru campus. She obtained her Ph. D in the area of graph theory from Dravidian university in the year 2015. Her areas of research interest include graph theory and discrete mathematics.

## Qualification

Degree University Year
Ph.D Dravidian 2015
M.Sc. Bangalore 1996

## Publications

### Publication Type: Journal Article

Year of Publication Title

2014

Dr. Geetha K. N., Dr. K. N. Meera, 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 »»

2013

Dr. K. N. Meera and Sooryanarayana, B., “Strict boundary vertices of a graph”, Advances and applications in discrete mathematics, vol. 12, no. 1, pp. 61–72, 2013.[Abstract]

Let G be a simple connected graph. A vertex v of G is said to be a boundary vertex of another vertex u of G if d(w, u) ≤ d(u, v) for each neighbor w of v. If a vertex v is a boundary vertex of any vertex u of G, then it is said to be a boundary vertex of the graph G. In this paper, we define a vertex v of G to be a strict boundary vertex of
another vertex u of G if d(w, u) < d(u, v) for each neighbor w of v. If a vertex v is a strict boundary vertex of any vertex u of G, then it is said to be a strict boundary vertex of the graph G. In this paper, we study the properties of strict boundary vertices of a graph.

More »»

2013

Dr. Geetha K. N., Dr. K. N. Meera, N, N., and Sooryanarayana, B., “Open neighborhood coloring of graphs”, International journal of contemporary mathematical sciences, vol. 8, pp. 13–16, 2013.

2012

Dr. K. N. Meera and Sooryanarayana, B., “Radiatic dimension of a graph”, Journal of computations and modelling, vol. 2, no. 4, pp. 109–131, 2012.[Abstract]

Let G(V, E) be a simple, finite, connected graph. An injective mapping f : V (G) → Z + such that for every two distinct vertices u, v ∈ V (G), |f(u) − f(v)| ≥ diam(G) + 1 − d(u, v) is called a radio labeling of G. The radio number of f, denoted by rn(f) is the maximum number assigned to any vertex of G. The radio number of G, is the minimum value of rn(f) taken over all radio labelings f of G. A graph G on n vertices is radio graceful if and only if rn(G) = n. In this paper, we define the radiatic dimension of G to be the smallest
positive integer k, such that the sequence of injective functions fi: V (G) → {1, 2, 3, . . . , n}, 1 ≤ i ≤ k, satisfy the condition that for every two distinct vertices u, v ∈ V (G), |fi(u)−fi(v)| ≥ diam(G)+ 1−d(u, v) for some i and denote it by rd(G). Hence a graph is radio graceful if and only if rd(G) = 1. In this paper we study the radiatic dimension of some standard g

More »»

2011

Dr. K. N. Meera and Sooryanarayana, B., “Optimal Outer sum number of a graph”, International Journal of combinatorial graph theory and applications, vol. 4, no. 1, pp. 23–35, 2011.

Faculty Research Interest: