Meera K. N

Dr. Meera K. N


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2016 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
MNMeera K. N
Meera K. N
B. SooryanarayanaB. Sooryanarayana
B. Sooryanarayana

1 November 2019 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
PDF file
MNMeera K. N
Meera K. N
A one-one mapping f : V (G) → Z+ satisfying the condition d ( u , v ) + [ f ( u ) f ( v ) ] ≥ d i a m ( G ) + 1 , for every pair of distinct vertices in G is defined as radio geometric mean labeling of G. The maximum number assigned to any vertex of G under the labeling f is called its radio geometric mean number of f denoted rgmn (f). The least value of rgmn (f), taken over all such labelings f of G is defined as its radio geometric mean number and is denoted by rgmn (G). Clearly, rgmn (G) ≥ |V(G)|. Graphs for which rgmn (G) = |V(G)| are defined as radio geometric graceful. In this paper, we find the radio geometric mean number of certain classes of graphs like sunflowers, Helms, gear graphs and show that they are radio geometric graceful.

1 March 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
YLY Lavanya
Y Lavanya
DHDhanyashree
Dhanyashree
MNMeera K. N
Meera K. N

4 July 2022 in IEEE Access
Verified
Journal Article
Open access
MSMeera Saraswathi
Meera Saraswathi
MNMeera K. N
Meera K. N
In this article, we point out the flaws in Theorem 1 of the article “Badr, Elsayed, et al. ”An integer linear programming model for solving radio mean labeling problem.“ IEEE Access 8(2020) : 162343-162349” and show that the radio mean number of cycles Cn determined in Theorem 1 is incorrect when n ≥ 16 by defining radio mean labeling with lower span. We thus derive an improved upper bound on the radio mean number of Cn, n ≥ 16.

1 January 2020 in Journal of Computational and Theoretical Nanoscience
Verified
Journal Article
Closed access
CGC. V. Giriraja
C. V. Giriraja
VCV. Chirag
V. Chirag
CSC. Sudheendra
C. Sudheendra
SBSamarth S. Bellur
Samarth S. Bellur
TRT. K. Ramesh
T. K. Ramesh
MNMeera K. N
Meera K. N
In this paper, A novel and efficient time division multiple access (TDMA) algorithm for military last-mile data communication is designed. A dynamic slot assignment method coupled with an out-of-band control mechanism is used for the proposed design. In out-of-band, there is a well-defined control segment along with the data segment. So, if a new node specifically a high priority node arrives at the network, it can signal its arrival by a response in the designated mini-slots and can also check the slot in the network, if no idle slots are available. Assigning priority to the nodes would also ensure the delivery of the important messages first. Query messages are broadcasted by the Central node in order to detect new nodes. This reduces nodes working time and also ensures that the nodes don’t interrupt any existing communication. Furthermore, we describe the feasibility and the reliability of this algorithm for military’s last-mile (end user) data communication.

23 April 2024 in IEEE Access
Verified
Journal Article
Open access
DHDhanyashree
Dhanyashree
MNMeera K. N
Meera K. N
SBSaid Broumi
Said Broumi
An $L(p_{1},~p_{2},~p_{3},~{\dots },~p_{m})$ - labeling of a graph $G$ is an assignment of positive integers to the vertices of $G$ such that the difference in the labels assigned to the vertices at distance $i$ should be at least $p_{i}$ . The particular case of $p_{1} = d, \,\,p_{2} = d-1, \,\,p_{3} = d-2, {\dots }, p_{d} = 1$ where $d$ is the diameter of the graph, was known as the radio labeling of $G$ . The minimum value of the maximum integer used in any feasible radio labeling of $G$ was called as radio number of $G$ denoted by $rn(G)$ . The idea of radio path coloring was conceived to ensure secure communication in networks. If there exists a path between each pair of vertices, such that, the labeling in that path is an $L(p_{1},\,\,p_{1}-1,\,\,p_{1}-2,\,\,{\dots },\,\,1)-$ labeling, then such a labeling was called an $L(p_{1},\,\,p_{1}-1,\,\,p_{1}-2,\,\,{\dots },\,\,1)-$ path coloring or a radio path coloring of $G$ . The minimum value of the largest label used in such a coloring was called as the radio path connection number. Earlier researchers have studied the case of $p_{1}=2$ for different classes of graphs. We focus on the more general case of $p_{1} \geq 3$ and obtain an upper bound on the radio connection number $k_{p_{1}c}(G)$ , of any semi-Hamiltonian graph $G$ . An algorithm to obtain the radio path coloring of a Semi-Hamiltonian graph $G$ is also discussed here and the same is used to generate keys for secure communication in cryptography.