10 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…
The vertex visibility number of graphs
Dhanya Roy, Gabriele Di Stefano, Sandi Klavžar +1
If , then is an -visibility set if for any there exists a shortest -path avoiding . The -visibility number $v_x(G)…
Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
Saneesh Babu, Boštjan Brešar, Aparna Lakshmanan S +1
The concept of mutual-visibility (MV) has been extended in several directions. A vertex subset of a graph is a -distance mutual-visibility (DMV) set if for any two ve…
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…
The k-Sudoku Number of Graphs
Manju S Nair, Aparna Lakshmanan S, S Arumugam
Let be a graph of order with chromatic number . Let and . Let be a -coloring of the induced subgraph . The c…
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…