Alvaro Carbonero

activity

20212023

3

-graphs

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

collaborators

Showing 2021Show all

4 papers · 1 filter

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…

math.CO2021

Towards a characterization of convergent sequences of $P_{n}$ -line graphs

Alvaro Carbonero

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$ -line graph of $G$ , denoted by $H L (G)$ , is that graph whose vertices are the edges of $G$ a…

math.CO2021

Permutations of point sets in $R^{d}$

Alvaro Carbonero, Beth Anne Castellano, Gary Gordon +3

Given a set $S$ consisting of $n$ points in $R^{d}$ and one or two vantage points, we study the number of orderings of $S$ induced by measuring the distance (for one vantage…

The Optimization of Signed Trees

Crowns in linear 3-graphs

Towards a characterization of convergent sequences of Pn​-line graphs

Permutations of point sets in Rd

Crowns in linear $3$ -graphs

Towards a characterization of convergent sequences of $P_{n}$ -line graphs

Permutations of point sets in $R^{d}$