7 papers
Mutual-visibility Coloring of Graphs
Saneesh Babu, Gabriele Di Stefano, Aparna Lakshmanan S
The mutual-visibility chromatic number of a graph is the smallest number of colors needed to color the vertices of such that each color class is a mutual-visibility set. In…
Ramsey sequences with bounded clique size
Abhishek Girish Aher, Aparna Lakshmanan S
A sequence of graphs is a Ramsey sequence if for every positive integer , the graph is a proper subgraph of , and there exists an integer $n > k…
Varieties of mutual-visibility and general position on Sierpiński graphs
Dhanya Roy, Sandi Klavžar, Aparna Lakshmanan +1
The variety of mutual-visibility problems contains four members, as does the variety of general position problems. The basic problem is to determine the cardinality of the largest…
Erdős Conjecture and AR-Labeling
Arun J Manattu, Aparna Lakshmanan S
Given an edge labeling of a graph , a vertex is called an -vertex, if has distinct edge weight sums for each distinct subset of edges incident on . An injecti…
On Geodesic Leech Labeling of Some Graph Classes
Aparna Lakshmanan S, Arun J Manattu
Let be an edge labeling of . The geodesic path number of , , is the number of geodesic paths in . An edge labeling is calle…
An edge labeling of graphs from Rados partition regularity condition
Arun J Manattu, Aparna Lakshmanan S
A vertex is called an AR-vertex, if has distinct edge weight sums for each distinct subset of edges incident on . i.e., if are the edge labels of…
On the Double Roman Domination Number of Generalized Sierpinski Graphs
Anu V., Aparna Lakshmanan S.
In this paper, we study the double Roman domination number of generalized Sierpiński graphs . More precisely, we obtain a bound for the double Roman domination number of $S…