Pablo Romero
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pablo Romero has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Franco Robledo
Facultad de Ingenieria, Universidad de la Republica, Montevideo 11300, Uruguay
20 shared publications - Omar Viera
Universidad de la República
5 shared publications - Pablo Rodríguez-Bocca
Facultad de Ingeniería Universidad de la República Montevideo Uruguay
5 shared publications - Pablo Sartor
IEEM Business School, Universidad de Montevideo, Montevideo 16000, Uruguay
5 shared publications Franco Robledo
Facultad de Ingeniería - Universidad de la República
4 shared publications- Héctor Cancela
Universidad de la Repblica, Montevideo, Uruguay
4 shared publications
Latest Publications
Infinitely Many Counterexamples to Conjectures by Boesch and Ath‐Sobel
Let be the set of connected simple graphs on vertices and edges. Define the corank of as . Let be in and . The reliability is the probability of being connected after each of its edges is removed independently with probability . The graph is a uniformly most reliable graph (UMRG) if for every in and for all . In 1986, Boesch conjectured that each nonempty class contains at least one UMRG. A few years later, Boesch et al. and Wang proved that each class having corank up to 4 includes one UMRG. However, infinitely many counterexamples to the Boesch conjecture appeared. Ath and Sobel conjectured that the Boesch conjecture holds when the corank is between 5 and 8, provided the number of vertices is at least . Recently, it was proved that there are only finitely many UMRGs having corank 5, in strong contrast with graph classes having corank up to 4. A natural question is the existence of UMRGs having corank 6. Here, it is proved that for each positive integer there is no UMRG on vertices having corank 6. This result provides new families of counterexamples to the Boesch and Ath‐Sobel conjectures proposed respectively in 1986 and 2000.
Infinitely Many Counterexamples to Conjectures by Boesch and Ath‐Sobel
Let be the set of connected simple graphs on vertices and edges. Define the corank of as . Let be in and . The reliability is the probability of being connected after each of its edges is removed independently with probability . The graph is a uniformly most reliable graph (UMRG) if for every in and for all . In 1986, Boesch conjectured that each nonempty class contains at least one UMRG. A few years later, Boesch et al. and Wang proved that each class having corank up to 4 includes one UMRG. However, infinitely many counterexamples to the Boesch conjecture appeared. Ath and Sobel conjectured that the Boesch conjecture holds when the corank is between 5 and 8, provided the number of vertices is at least . Recently, it was proved that there are only finitely many UMRGs having corank 5, in strong contrast with graph classes having corank up to 4. A natural question is the existence of UMRGs having corank 6. Here, it is proved that for each positive integer there is no UMRG on vertices having corank 6. This result provides new families of counterexamples to the Boesch and Ath‐Sobel conjectures proposed respectively in 1986 and 2000.
- 7 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 379, 855-871
Most reliable graphs with reduced corank
- 7 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 379, 855-871
Most reliable graphs with reduced corank
- 27 October 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 407-419
Nonexistence of uniformly most reliable graphs of least corank
- 27 October 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 407-419
Nonexistence of uniformly most reliable graphs of least corank
- Open Access
Construction of infinitely many trace-minimal graphs with maximum number of spanning trees
A longstanding problem in spectral graph theory asks for graphs with maximum number of spanning trees among all connected simple graphs with a prescribed number of vertices and edges. Such graphs are called t-optimal graphs. Petingi and Rodríguez [Discrete Math. 244 (2002), 351--373] achieved in finding infinitely many t-optimal graphs. Basically, they reduced the problem of finding t-optimal graphs to the determination of almost-regular graphs with minimum number of induced 3-paths. In this work we revisit the construction of t-optimal graphs given by Petingi and Rodríguez. Then, we generalize the previous construction using the key concept of trace-minimal graph introduced by Ábrego et al. [Linear Algebra Appl. 412 (2006) 161--221]. Finally, as a consequence, we construct infinitely many new t-optimal regular graphs.
Open AccessConstruction of infinitely many trace-minimal graphs with maximum number of spanning trees
A longstanding problem in spectral graph theory asks for graphs with maximum number of spanning trees among all connected simple graphs with a prescribed number of vertices and edges. Such graphs are called t-optimal graphs. Petingi and Rodríguez [Discrete Math. 244 (2002), 351--373] achieved in finding infinitely many t-optimal graphs. Basically, they reduced the problem of finding t-optimal graphs to the determination of almost-regular graphs with minimum number of induced 3-paths. In this work we revisit the construction of t-optimal graphs given by Petingi and Rodríguez. Then, we generalize the previous construction using the key concept of trace-minimal graph introduced by Ábrego et al. [Linear Algebra Appl. 412 (2006) 161--221]. Finally, as a consequence, we construct infinitely many new t-optimal regular graphs.
- Open Access
Existence, uniqueness and construction of locally most reliable two-terminal graphs
A two-terminal graph is a graph G equipped with two vertices in V(G) called terminals. Let T(n,m) be the set of two-terminal graphs on n vertices and m edges. Let G be in T(n,m) and let p be in [0,1]. The two-terminal reliability of G at p, denoted R_G(p), is the probability that G has a path joining its terminals after each of its edges is independently removed with probability 1 - p. We say G is a locally most reliable two-terminal graph (LMRTTG) if for each H in T(n,m) there exists a positive real number delta such that for every p in (0, delta) it holds that R_G(p) >= R_H(p). It is simple to prove that there exists a unique LMRTTG in T(n,m) when n >= 4 and 5 <= m <= 2n - 3. Gong and Lin [Discrete Appl. Math. 356 (2024), 393-402] further proved that there exists a unique LMRTTG in T(n,m) when n >= 6 and 2n - 3 <= m <= n(n - 1)/2, except for some pairs of integers n and m which satisfy that n >= 6 and (1/2)(n - 2)(n - 3) - (n - 2)/2 <= m - (2n - 3) <= (1/2)(n - 2)(n - 3) + (n - 2)/2. All cases unresolved in earlier works are covered here. In this article it is proved that in each set T(n,m) such that n >= 4 and 5 <= m <= n(n - 1)/2 there exists a unique LMRTTG, called G(n,m). A construction of G(n,m) is also given.
Open AccessExistence, uniqueness and construction of locally most reliable two-terminal graphs
A two-terminal graph is a graph G equipped with two vertices in V(G) called terminals. Let T(n,m) be the set of two-terminal graphs on n vertices and m edges. Let G be in T(n,m) and let p be in [0,1]. The two-terminal reliability of G at p, denoted R_G(p), is the probability that G has a path joining its terminals after each of its edges is independently removed with probability 1 - p. We say G is a locally most reliable two-terminal graph (LMRTTG) if for each H in T(n,m) there exists a positive real number delta such that for every p in (0, delta) it holds that R_G(p) >= R_H(p). It is simple to prove that there exists a unique LMRTTG in T(n,m) when n >= 4 and 5 <= m <= 2n - 3. Gong and Lin [Discrete Appl. Math. 356 (2024), 393-402] further proved that there exists a unique LMRTTG in T(n,m) when n >= 6 and 2n - 3 <= m <= n(n - 1)/2, except for some pairs of integers n and m which satisfy that n >= 6 and (1/2)(n - 2)(n - 3) - (n - 2)/2 <= m - (2n - 3) <= (1/2)(n - 2)(n - 3) + (n - 2)/2. All cases unresolved in earlier works are covered here. In this article it is proved that in each set T(n,m) such that n >= 4 and 5 <= m <= n(n - 1)/2 there exists a unique LMRTTG, called G(n,m). A construction of G(n,m) is also given.
- 21 May 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1047
Characterization of locally most split reliable graphs
- 21 May 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1047
Characterization of locally most split reliable graphs
- Open Access
Existence of most reliable two-terminal graphs with distance constraints
A two-terminal graph is a simple graph equipped with two distinguished vertices, called terminals. Let $T_{n,m}$ be the class consisting of all nonisomorphic two-terminal graphs on $n$ vertices and $m$ edges. Let $G$ be any two-terminal graph in $T_{n,m}$, and let $d$ be any positive integer. For each $ρ\in [0,1]$, the \emph{$d$-constrained two-terminal reliability of $G$ at $ρ$}, denoted $R_G^d(ρ)$, is the probability that $G$ has some path of length at most $d$ joining its terminals after each of its edges is independently deleted with probability $ρ$. We say $G$ is a \emph{$d$-uniformly most reliable two-terminal graph} ($d$-UMRTTG) if for each $H$ in $T_{n,m}$ and every $ρ\in [0,1]$ it holds that $R_{G}^d(ρ)\geq R_H^d(ρ)$. Previous works studied the existence of $d$-UMRTTG in $T_{n,m}$ when $d$ is greater than or equal to $n-1$, or equivalently, when the distance constraint is dropped. In this work, a characterization of all $1$-UMRTTGs and $2$-UMRTTGs is given. Then, it is proved that there exists a unique $3$-UMRTTG in $T_{n,m}$ when $n\geq 6$ and $5 \leq m \leq 2n-3$. Finally, for each $d\geq 4$ and each $n\geq 11$ it is proved that there is no $d$-UMRTTG in $T_{n,m}$ when $20 \leq m \leq 3n-9$ or when $3n-5 \leq m \leq \binom{n}{2}-2$.Open AccessExistence of most reliable two-terminal graphs with distance constraints
A two-terminal graph is a simple graph equipped with two distinguished vertices, called terminals. Let $T_{n,m}$ be the class consisting of all nonisomorphic two-terminal graphs on $n$ vertices and $m$ edges. Let $G$ be any two-terminal graph in $T_{n,m}$, and let $d$ be any positive integer. For each $ρ\in [0,1]$, the \emph{$d$-constrained two-terminal reliability of $G$ at $ρ$}, denoted $R_G^d(ρ)$, is the probability that $G$ has some path of length at most $d$ joining its terminals after each of its edges is independently deleted with probability $ρ$. We say $G$ is a \emph{$d$-uniformly most reliable two-terminal graph} ($d$-UMRTTG) if for each $H$ in $T_{n,m}$ and every $ρ\in [0,1]$ it holds that $R_{G}^d(ρ)\geq R_H^d(ρ)$. Previous works studied the existence of $d$-UMRTTG in $T_{n,m}$ when $d$ is greater than or equal to $n-1$, or equivalently, when the distance constraint is dropped. In this work, a characterization of all $1$-UMRTTGs and $2$-UMRTTGs is given. Then, it is proved that there exists a unique $3$-UMRTTG in $T_{n,m}$ when $n\geq 6$ and $5 \leq m \leq 2n-3$. Finally, for each $d\geq 4$ and each $n\geq 11$ it is proved that there is no $d$-UMRTTG in $T_{n,m}$ when $20 \leq m \leq 3n-9$ or when $3n-5 \leq m \leq \binom{n}{2}-2$. - Open Access
Characterization of locally most split reliable graphs
A two-terminal graph is a graph equipped with two distinguished vertices, called terminals. Let $T_{n,m}$ be the set of all nonisomorphic connected simple two-terminal graphs on $n$ vertices and $m$ edges. Let $G$ be any two-terminal graph in $T_{n,m}$. For every number $p$ in $[0,1]$ we let each of the edges in $G$ be independently deleted with probability $1-p$. The split reliability $SR_{G}(p)$ is the probability that the resulting spanning subgraph has precisely $2$ connected components, each one including one terminal. The two-terminal graph $G$ is uniformly most split reliable if $SR_G(p)\geq SR_{H}(p)$ for each $H$ in $T_{n,m}$ and every $p$ in $[0,1]$. We say $G$ is locally most split reliable if there exists $δ>0$ such that $SR_G(p)\geq SR_{H}(p)$ for each $H$ in $T_{n,m}$ and every $p$ in $(1-δ,1)$. Brown and McMullin showed that there exists uniformly most split reliable graphs in each class $T_{n,m}$ such that $m=n-1$, $m=\binom{n}{2}$, or $m=\binom{n}{2}-1$. The authors also proved that there is no uniformly most split reliable two-terminal graph in $T_{n,n}$ when $n\geq 6$ and specified in which classes $T_{n,m}$ such that $n\leq 7$ there exist uniformly most split reliable graphs. The existence or nonexistence of uniformly most split reliable graphs in the remaining cases is posed by Brown and McMullin as an open problem. In this work, the set $\mathcal{G}_{n,m}$ consisting of all locally most split reliable graphs is characterized in each nonempty class $T_{n,m}$. It is proved that a graph in $T_{n,m}$ is locally most split reliable if and only if its split reliability equals that of the balloon graph equipped with two terminals whose distance equals its diameter. Finally, it is proved that there is no uniformly most split reliable graph in $T_{n,m}$ when $n\geq 7$ and $n\leq m \leq \binom{n-3}{2}+3$.Open AccessCharacterization of locally most split reliable graphs
A two-terminal graph is a graph equipped with two distinguished vertices, called terminals. Let $T_{n,m}$ be the set of all nonisomorphic connected simple two-terminal graphs on $n$ vertices and $m$ edges. Let $G$ be any two-terminal graph in $T_{n,m}$. For every number $p$ in $[0,1]$ we let each of the edges in $G$ be independently deleted with probability $1-p$. The split reliability $SR_{G}(p)$ is the probability that the resulting spanning subgraph has precisely $2$ connected components, each one including one terminal. The two-terminal graph $G$ is uniformly most split reliable if $SR_G(p)\geq SR_{H}(p)$ for each $H$ in $T_{n,m}$ and every $p$ in $[0,1]$. We say $G$ is locally most split reliable if there exists $δ>0$ such that $SR_G(p)\geq SR_{H}(p)$ for each $H$ in $T_{n,m}$ and every $p$ in $(1-δ,1)$. Brown and McMullin showed that there exists uniformly most split reliable graphs in each class $T_{n,m}$ such that $m=n-1$, $m=\binom{n}{2}$, or $m=\binom{n}{2}-1$. The authors also proved that there is no uniformly most split reliable two-terminal graph in $T_{n,n}$ when $n\geq 6$ and specified in which classes $T_{n,m}$ such that $n\leq 7$ there exist uniformly most split reliable graphs. The existence or nonexistence of uniformly most split reliable graphs in the remaining cases is posed by Brown and McMullin as an open problem. In this work, the set $\mathcal{G}_{n,m}$ consisting of all locally most split reliable graphs is characterized in each nonempty class $T_{n,m}$. It is proved that a graph in $T_{n,m}$ is locally most split reliable if and only if its split reliability equals that of the balloon graph equipped with two terminals whose distance equals its diameter. Finally, it is proved that there is no uniformly most split reliable graph in $T_{n,m}$ when $n\geq 7$ and $n\leq m \leq \binom{n-3}{2}+3$. - 5 February 2025
- Published by Springer Nature
- p. 270-279
An Algebraic Characterization of Strong Graphs
- 5 February 2025
- Published by Springer Nature
- p. 280-291
There are Finitely Many Uniformly Most Reliable Graphs of Corank 5
- 5 February 2025
- Published by Springer Nature
- p. 280-291
There are Finitely Many Uniformly Most Reliable Graphs of Corank 5