10 citations · 11 across the 6 of their papers we have counts for
6 papers · 1 filter
Certain graphs with exactly one irreducible -module with endpoint , which is thin: the pseudo-distance-regularized case
Blas Fernández
Let denote a finite, simple and connected graph. Fix a vertex of which is not a leaf and let denote the Terwilliger algebra of with respect to . Assume…
On minimally tough chordal graphs
Clément Dallard, Blas Fernández, Gyula Y. Katona +2
Katona and Varga showed that for any rational number , no chordal graph is minimally -tough, while Katona and Khan characterized all minimally -tough, chordal…
On (almost) --homogeneous distance-biregular graphs
Blas Fernandez, Safet Penjic
Let denote a bipartite graph with vertex set , color partitions , , and assume that every vertex in has eccentricity . For and a non-negative int…
On some problems regarding distance-balanced graphs
Blas Fernandez, Ademir Hujdurovic
A graph is said to be distance-balanced if for any edge of , the number of vertices closer to than to is equal to the number of vertices closer to than to $…
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 of $\G$ there ar…
Canonical double covers of circulants
Blas Fernandez, Ademir Hujdurović
The canonical double cover of a graph is the direct product of and . If then is called stable; otherwise is…