N. Apollonio

activity

20142026

most citedA New Characterization of Path Graphs

1 citations · 1 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

A universal dichotomy for concentration in randomly colored graphs

Nicola Apollonio

Let $ζ$ be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with $s$ colors such that…

math.CO2024

Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs

Nicola Apollonio

We show that for a certain class of convex functions $f$ , including the exponential functions $x \mapsto e^{λ x}$ with $λ > 0$ a real number, and all the powers $x \mapsto x^{β}$ , $x\geq…

math.CO2023

Second-order moments of the size of randomly induced subgraphs of given order

Nicola Apollonio

For a graph $G$ and a positive integer $c$ , let $M_{c} (G)$ be the size of a subgraph of $G$ induced by a randomly sampled subset of $c$ vertices. Second-order moments of $M_{c} (G)$ enc…

math.CO2022

Two New Characterizations of Path Graphs

Nicola Apollonio, Lorenzo Balzotti

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths i…