Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

An Analytical Discourse on Strong Edge Coloring for Interference-free Channel Assignment in Interconnection Networks

- I. A. Arputhamary, H. Mercy
- Mathematics, Computer Science
- Wirel. Pers. Commun.
- 1 June 2017

TLDR

Location Domination for Generalized Friendship Graphs Analytics

- D. Angel, I. A. Arputhamary, K. Ezhilarasi
- 5th International Conference on Computing…
- 8 April 2021

Locating defective elements in a processor network brings the motivation for location dominating sets. In this paper, the location dominating set problem for friendship graphs is solved. Location… Expand

Strong Edge Coloring of Some Classes of Unicyclic Graphs

Let G be an undirected simple graph. A strong edge coloring of a graph G is a function f : E → {1, 2, . . . , k} such that f(e1) 6= f(e2) whenever e1 and e2 lie within distance 2 from each other. In… Expand

Strong Rainbow Edge Coloring of Some Interconnection Networks

- I. A. Arputhamary, M. Mercy
- Computer Science
- 2015

TLDR

A Study on Strong Rainbow Vertex-Connection in Some Classes of Generalized Petersen Graphs

- M. HeldaMercy, I. A. Arputhamary
- Computer Science
- 2020

TLDR

Wireless Networks Analysis based on Graphs with Equal and Strong Proper Connection Number

- I. A. Arputhamary, D. Angel
- 6th International Conference on Inventive…
- 20 January 2021

An edge colored graph is properly colored if there exists a proper path (a path in which two neighboring edges do not acquire identical color) amid every two distinct vertices. Such a graph is called… Expand

Strong rainbow vertex-connection of cubic graphs

- I. A. Arputhamary, M. Mercy
- Computer Science
- IEEE 9th International Conference on Intelligent…
- 1 October 2015

TLDR

Strong rainbow edge colouring and graph decomposition

- I. A. Arputhamary, M. Mercy
- Computer Science
- 1 November 2016

TLDR

STRONG RAINBOW EDGE-COLOURING OF VARIANTS OF CUBIC HALIN GRAPHS

- I. A. Arputhamary, M. Mercy
- Mathematics
- 26 January 2017

A non trivial connected graph G = (V,E) is strongly rainbow connected if every two vertices u and v of G are connected by at least one shortest u− v path in which no two edges have same colours. The… Expand

On strong rainbow vertex-coloring of generalized Petersen graphs G(n,2) and G(n,3)

- I. A. Arputhamary, M. Mercy
- Mathematics
- 2017

A path in a vertex-colored graph G is called a rainbow path if no two internal vertices get the same color. A vertex-colored graph G is strongly rainbow vertexconnected, if for every pair of distinct… Expand