Pietro Negrini

collaborators

2 papers

math.CO2026

A graph reconstruction problem involving common neighbors

Michela Ascolese, Pietro Negrini, Silvia Maria Carla Pagani +1

Given a simple graph $G = (V, E)$ on $v$ vertices and two distinct vertices $x, y \in V$ , the co-degree $c_{x, y}$ associated to the pair ${x, y}$ is the number of their common ne…

math.CO2026

Cyclically $5$ -edge-connected snarks with resistance $2$ and flow resistance $n$

Davide Mattiolo, Pietro Negrini, Silvia M. C. Pagani

Snarks are $2$ -connected cubic graphs that do not admit a proper $3$ -edge-coloring. For a cubic graph $G$ , its resistance $r (G)$ is the minimum number of edges whose removal result…

A graph reconstruction problem involving common neighbors

Cyclically 5-edge-connected snarks with resistance 2 and flow resistance n

Cyclically $5$ -edge-connected snarks with resistance $2$ and flow resistance $n$