Zobrazeno 1 - 10
of 2 028
pro vyhledávání: '"Maffucci A."'
We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two types of gr
Externí odkaz:
http://arxiv.org/abs/2404.07819
Autor:
Maffucci, Riccardo W.
We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and $3$-connected (i.e. $3$-polytopal). They are all of the form \[H\wedge K_2,\] where $H$ is a $2$-connected graph, possibly non-planar, and satisfying
Externí odkaz:
http://arxiv.org/abs/2402.01407
The geometry of Arithmetic Random Waves has been extensively investigated in the last fifteen years, starting from the seminal papers [RW08, ORW08]. In this paper we study the correlation structure among different functionals such as nodal length, bo
Externí odkaz:
http://arxiv.org/abs/2312.13166
Autor:
Maffucci, Riccardo W.
Recent literature posed the problem of characterising the graph degree sequences with exactly one $3$-polytopal (i.e. planar, $3$-connected) realisation. This seems to be a difficult problem in full generality. In this paper, we characterise the sequ
Externí odkaz:
http://arxiv.org/abs/2308.12853
Autor:
Loredana Mulas, Elena Santini, Marta Azzolin, Mauro Buonocore, Ilaria Campana, Lara Carosso, Giovanni Coppini, Matteo Costantino, Léa David, Marianna Farina, Livio Favaro, Natalia Fraija-Fernández, Marco Gamba, Maria Leonor Garcia Gutiérrez, Cristina Giacoma, Martina Gregorietti, Rita Lecci, Giulia Luzi, Fulvio Maffucci, Francesco Paolo Mancuso, Valeria Masala, Erica Moura, Eugenia Pasanisi, Juan Antonio Raga, Selvaggia Santin, Gianluca Sarà, Antonella Servidio, Paola Tepsich, Francesco Tomasinelli, Gianluca Treglia, Roberta Teti, Elena Valsecchi, Morgana Vighi, Antonella Arcangeli
Publikováno v:
ARPHA Proceedings, Vol 6, Iss , Pp 79-82 (2024)
The manuscript provides an overview of the mid-term results of the citizen science campaign activities conducted within the Life CONCEPTU MARIS project (LIFE20 NAT/IT/001371) whose aim is to improve the conservation status of cetaceans and pelagic se
Externí odkaz:
https://doaj.org/article/7c431af246584a428e3a8eede52379eb
Autor:
Maffucci, Riccardo W.
Publikováno v:
European Journal of Combinatorics (2024+)
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a difficult pr
Externí odkaz:
http://arxiv.org/abs/2305.20012
Autor:
Maffucci, Riccardo W.
We consider the graph degree sequences such that every realisation is a polyhedron. It turns out that there are exactly eight of them. All of these are unigraphic, in the sense that each is realised by exactly one polyhedron. This is a revisitation o
Externí odkaz:
http://arxiv.org/abs/2305.15063
Autor:
Delitroz, Jim, Maffucci, Riccardo W.
A sequence $\sigma$ of $p$ non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a $3$-connected, planar graph. We investigate which sequences are unigraphic with respect to th
Externí odkaz:
http://arxiv.org/abs/2301.08021
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 integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that th
Externí odkaz:
http://arxiv.org/abs/2212.14323
Publikováno v:
Urology Video Journal, Vol 23, Iss , Pp 100280- (2024)
Objective: Renal artery aneurysms (RAA) may pose significant surgical challenges when encountered with coexisting pathology such as renal tumors. Herein, we demonstrate the management of a patient with an enhancing 6.6 cm central right renal mass and
Externí odkaz:
https://doaj.org/article/531bfaa859634a339af001cd584378dc