Riccardo W. Maffucci

activity

20162026

most citedNodal intersections for random waves against a segment on the 3-dimensional torus

14 citations · 39 across the 27 of their papers we have counts for

collaborators

Showing 2022Show all

4 papers · 1 filter

math.CO2022

Independence numbers of polyhedral graphs

Sébastien Gaspoz, Riccardo W. Maffucci

A polyhedral graph is a $3$ -connected planar graph. We find the least possible order $p (k, a)$ of a polyhedral graph containing a $k$ -independent set of size $a$ for all positive in…

math.CO2022

On smallest $3$ -polytopes of given graph radius

Riccardo W. Maffucci, Niels Willems

The $3$ -polytopes are planar, $3$ -connected graphs. A classical question is, for $r \geq 3$ , is the $2 (r - 1)$ -gonal prism $K_{2} \times C_{2 (r - 1)}$ the unique $3$ -polytope of graph radi…

math.CO2022★ 3 cited

Characterising $3$ -polytopes of radius one with unique realisation

Riccardo W. Maffucci

Let $F$ be a planar, $3$ -connected graph of radius one on $p$ vertices, with $a$ vertices of degree three. We characterise all unigraphic degree sequences for such graphs, when $a\…

math.CO2022

On unigraphic $3$ -polytopes of radius one

Riccardo W. Maffucci

We ask which degree sequences admit a unique realisation as a $3$ -polytopal graph (polyhedron) on $p$ vertices. We give an exhaustive list of these sequences for the case where one…

Independence numbers of polyhedral graphs

On smallest 3-polytopes of given graph radius

Characterising 3-polytopes of radius one with unique realisation

On unigraphic 3-polytopes of radius one

On smallest $3$ -polytopes of given graph radius

Characterising $3$ -polytopes of radius one with unique realisation

On unigraphic $3$ -polytopes of radius one