B. Fernández

activity

20202023

most citedCanonical double covers of circulants

10 citations · 11 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2023

Certain graphs with exactly one irreducible $T$ -module with endpoint $1$ , which is thin: the pseudo-distance-regularized case

Blas Fernández

Let $Γ$ denote a finite, simple and connected graph. Fix a vertex $x$ of $Γ$ which is not a leaf and let $T = T (x)$ denote the Terwilliger algebra of $Γ$ with respect to $x$ . Assume…

math.CO2022

On minimally tough chordal graphs

Clément Dallard, Blas Fernández, Gyula Y. Katona +2

Katona and Varga showed that for any rational number $t \in (1/2, 1]$ , no chordal graph is minimally $t$ -tough, while Katona and Khan characterized all minimally $t$ -tough, chordal…

math.CO2022

On (almost) $2$ - $Y$ -homogeneous distance-biregular graphs

Blas Fernandez, Safet Penjic

Let $Γ$ denote a bipartite graph with vertex set $X$ , color partitions $Y$ , $Y^{'}$ , and assume that every vertex in $Y$ has eccentricity $D \geq 3$ . For $z \in X$ and a non-negative int…

math.CO2022★ 1 cited

On some problems regarding distance-balanced graphs

Blas Fernandez, Ademir Hujdurovic

A graph $Γ$ is said to be distance-balanced if for any edge $uv$ of $Γ$ , the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $…

math.CO2021

On certain regular nicely distance-balanced graphs

Blas Fernandez, Štefko Miklavič, Safet Penjić

A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $γ=γ(\G)$, such that for any two adjacent vertices $u, v$ of $\G$ there ar…

math.CO2020★ 10 cited

Canonical double covers of circulants

Blas Fernandez, Ademir Hujdurović

The canonical double cover $B (X)$ of a graph $X$ is the direct product of $X$ and $K_{2}$ . If $A u t (B (X)) ≅ A u t (X) \times Z_{2}$ then $X$ is called stable; otherwise $X$ is…

Certain graphs with exactly one irreducible T-module with endpoint 1, which is thin: the pseudo-distance-regularized case