The following pages link to J. Fàbrega (Q403555):
Displaying 33 items.
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes (Q403556) (← links)
- Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing (Q510568) (← links)
- Edge-distance-regular graphs (Q549255) (← links)
- Extraconnectivity of graphs with large girth (Q1322225) (← links)
- On the distance connectivity of graphs and digraphs (Q1322268) (← links)
- Fault-tolerant routings in double fixed-step networks (Q1377656) (← links)
- Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825) (← links)
- On the extraconnectivity of graphs (Q1923481) (← links)
- Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
- Uniform forcing and immune sets in graphs and hypergraphs (Q2235248) (← links)
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes (Q2380238) (← links)
- Combinatorial vs. algebraic characterizations of completely pseudo-regular codes (Q2380471) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected (Q2569934) (← links)
- (Q2857348) (← links)
- (Q3222233) (← links)
- (Q3325756) (← links)
- (Q3328571) (← links)
- (Q3490015) (← links)
- (Q3688411) (← links)
- (Q3734430) (← links)
- (Q3794087) (← links)
- (Q3972297) (← links)
- Maximally connected digraphs (Q4206749) (← links)
- Fault-tolerant routings in chordal ring networks (Q4520242) (← links)
- (Q4536351) (← links)
- Superconnected digraphs and graphs with small conditional diameters (Q4537622) (← links)
- Connectedness of digraphs and graphs under constraints on the conditional diameter (Q4667716) (← links)
- (Q4873825) (← links)
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity (Q5124690) (← links)
- (Q5184952) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing (Q6180036) (← links)
