activity
20192026
most citedImpact of Some Graph Operations on Double Roman Domination Number

1 citations · 4 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2026

A variety of the mutual-visibility coloring problem for graphs

Saneesh Babu, Marko Jakovac, Dorota Kuziak +2

This paper explores variations of vertex-coloring problems defined on graph visibility properties. It introduces and studies the dual, outer, and total mutual-visibility chromatic…

math.GR2025

Endomorphism and automorphism graphs of finite groups

Midhuna V Ajith, Peter J Cameron, Mainak Ghosh +1

Let be a group. The directed endomorphism graph, $\dend(G)$ of is a directed graph with vertex set and there is a directed edge from the vertex to the vertex if…

math.CO2025

Endomorphism and Automorphism Graphs

Midhuna V Ajith, Mainak Ghosh, Aparna Lakshmanan S

Let be a group. The directed endomorphism graph, \dend of is a directed graph with vertex set and there is a directed edge from the vertex `' to the vertex `'…

math.CO2023★ 1 cited

Hypergraphs defined on algebraic structures

Peter J. Cameron, Aparna Lakshmanan S., Midhuna V. Ajith

There has been a great deal of research on graphs defined on algebraic structures in the last two decades. In this paper we begin an exploration of hypergraphs defined on algebraic…

math.CO2021

The transformation of edge-regular and pseudo strongly regular graphs under graph operations

Jeepamol J Palathingal, Aparna Lakshmanan S, Greg Markowsky

The graph is said to be strongly regular with parameters if the following conditions hold: (1) each vertex has neighbours; (2) any two adjacent vertices of …

math.CO2021

Spectrum of Strongly Regular Graphs under Graph Operators

Jeepamol J Palathingal, Aparna Lakshmanan S, Greg Markowsky

In this paper, we show that if G is strongly regular then the Gallai graph and the anti-Gallai graph of G are edge-regular. We also identify conditions under which the Gallai and a…

math.CO2020★ 1 cited

Impact of Vertex Addition on Italian Domination Number

Jismy Varghese, Aparna Lakshmanan S

An Italian dominating function (IDF), of a graph G is a function satisfying the condition that for every with $ f(v) = 0, \sum_{ u\i…

math.CO2019★ 1 cited

Perfect Italian Domination Number of Graphs

Jismi Varghese, Aparna Lakshmanan S

In this paper, an upper bound for the perfect Italian domination number of the cartesian product of any two graphs is obtained and the exact value of this parameter for cartesian p…

math.CO2019★ 1 cited

Impact of Some Graph Operations on Double Roman Domination Number

Anu V., Aparna Lakshmanan S.

Given a graph , a function having the property that if , then there exist such that or th…