Alvaro Carbonero

most citedCrowns in linear

3

-graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022

The Inter-magic Spectra of Trees

Alvaro Carbonero, Dylan Obata

For any positive integer $h$ , a graph $G = (V, E)$ is said to be $h$ -magic if there exists a labeling $l : E (G) \to Z_{h} - {0}$ such that the induced vertex set labeling $\ l^+…

math.CO2021

The Optimization of Signed Trees

Alvaro Carbonero, Janelle Domantay, Karen Guthrie

A signed graph $G$ is a graph where each edge is assigned a + (positive edge) or a - (negative edge). The signed degree of a vertex $v$ in a signed graph, denoted by $s d e g (v)$ , is…

math.CO2021★ 2 cited

Crowns in linear $3$ -graphs

Alvaro Carbonero, Willem Fletcher, Jing Guo +3

A \textit{linear $3$ -graph}, $H = (V, E)$ , is a set, $V$ , of vertices together with a set, $E$ , of $3$ -element subsets of $V$ , called edges, so that any two distinct edges intersec…

The Inter-magic Spectra of Trees

The Optimization of Signed Trees

Crowns in linear 3-graphs

Crowns in linear $3$ -graphs