Serafino Cicerone

activity

20172025

most citedA methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study

4 citations · 6 across the 16 of their papers we have counts for

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2025

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

Networks are often modeled using graphs, and within this setting we introduce the notion of $k$ -fault-tolerant mutual visibility. Informally, a set of vertices $X \subseteq V (G)$ i…

math.CO2024

Mutual-visibility problems on graphs of diameter two

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S \subseteq V (G)$ so that for any two vertices $x, y \in S$ there is a shortest $x,…

math.CO2023

Mutual visibility in hypercube-like graphs

Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +2

Let $G$ be a graph and $X \subseteq V (G)$ . Then, vertices $x$ and $y$ of $G$ are $X$ -visible if there exists a shortest $u, v$ -path where no internal vertices belong to $X$ . The set…

math.CO2023

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm

Serafino Cicerone, Gabriele Di Stefano

The concept of mutual-visibility in graphs has been recently introduced. If $X$ is a subset of vertices of a graph $G$ , then vertices $u$ and $v$ are $X$ -visible if there exists a…

math.CO2023

Variety of mutual-visibility problems in graphs

Serafino Cicerone, Gabriele Di Stefano, Lara Drozek +3

If $X$ is a subset of vertices of a graph $G$ , then vertices $u$ and $v$ are $X$ -visible if there exists a shortest $u, v$ -path $P$ such that $V (P) \cap X \subseteq {u, v}$ . If each…

math.CO2022★ 2 cited

Mutual-visibility in strong products of graphs via total mutual-visibility

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

Let $G$ be a graph and $X \subseteq V (G)$ . Then $X$ is a mutual-visibility set if each pair of vertices from $X$ is connected by a geodesic with no internal vertex in $X$ . The mutua…

math.CO2021

On the mutual visibility in Cartesian products and triangle-free graphs

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar

Given a graph $G = (V (G), E (G))$ and a set $P \subseteq V (G)$ , the following concepts have been recently introduced: $(i)$ two elements of $P$ are \emph{mutually visible} if there is…