Josep Fàbrega - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

Immune sets in monotone infection rules. Characterization and complexityJosep Fàbrega, Jaume Martí-Farré, Xavier Muñoz. DAM, 339:202-215, November 2023. [doi]

Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routingJosep Fàbrega, Jaume Martí-Farré, Xavier Muñoz. networks, 82(4):527-550, December 2023. [doi]

2021

Uniform forcing and immune sets in graphs and hypergraphsJosep Fàbrega, Jaume Martí-Farré, Xavier Muñoz. DAM, 305:23-33, 2021. [doi]

2018

Online Matching in Regular Bipartite Graphs with Randomized AdversaryJosep Fàbrega, Xavier Muñoz. BIRTHDAY 2018: 297-310 [doi]

2016

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routingJosep Fàbrega, Jaume Martí-Farré, Xavier Muñoz. endm, 54:157-162, 2016. [doi]

2014

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codesM. Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. DAM, 176:12-18, 2014. [doi]

2011

Edge-distance-regular graphsM. Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. endm, 38:221-226, 2011. [doi]

Edge-distance-regular graphsM. Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. JCT, 118(7):2071-2091, 2011. [doi]

On large (Δ, ::::D::::, ::::D::::, 1)-graphsJosé Gómez, Josep Fàbrega, José Luis Andres Yebra. networks, 57(4):316-327, 2011. [doi]

2010

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular CodesM. Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. combinatorics, 17(1), 2010. [doi]

2009

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and CodesM. Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. combinatorics, 16(1), 2009. [doi]

2007

Edge-connectivity and edge-superconnectivity in sequence graphsCamino Balbuena, Josep Fàbrega, Pedro García-Vázquez. DAM, 155(16):2053-2060, 2007. [doi]

2005

(::::delta::::, ::::g::::)-cages with ::::g:::: geq 10 are 4-connectedXavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega. DM, 301(1):124-136, 2005. [doi]

Connectedness of digraphs and graphs under constraints on the conditional diameterXavier Marcote, Camino Balbuena, Josep Fàbrega. networks, 45(2):80-87, 2005. [doi]

2003

A Study of Network Capacity under Deflection Routing SchemesJosep Fàbrega, Xavier Muñoz. europar 2003: 989-994 [doi]

Connectivity and TraversabilityJosep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 193-339, Chapman & Hall / Taylor & Francis, 2003. [doi]

Using a progressive withdrawal procedure to study superconnectivity in digraphsIgnacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega. DM, 267(1-3):229-246, 2003. [doi]

2002

Superconnected digraphs and graphs with small conditional diametersCamino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo. networks, 39(3):153-160, 2002. [doi]

2000

Fault-tolerant routings in chordal ring networksLali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá. networks, 36(3):180-190, 2000. [doi]

Edge-Bisection of Chordal RingsLali Barrière, Josep Fàbrega. mfcs 2000: 162-171 [doi]

1999

Superconnectivity of bipartite digraphs and graphsCamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. DM, 197-198:61-75, 1999. [doi]

On the superconnectivity and the conditional diameter of graphs and digraphsAngeles Carmona, Josep Fàbrega. networks, 34(3):197-205, 1999. [doi]

1997

On the order and size of s-geodetic digraphs with given connectivityM. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. DM, 174(1-3):19-27, 1997. [doi]

Extraconnectivity of graphs with large minimum degree and girthCamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. DM, 167-168:85-100, 1997. [doi]

Connectivity of large bipartite digraphs and graphsM. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. DM, 174(1-3):3-17, 1997. [doi]

Fault-tolerant Routings in Double Fixed-step NetworksJosep Fàbrega, Marisa Zaragozá. DAM, 78(1-3):61-74, 1997. [doi]

1996

On the connectivity and the conditional diameter of graphs and digraphsCamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. networks, 28(2):97-105, 1996. [doi]

Bipartite Graphs and Digraphs with Maximum ConnectivityJosep Fàbrega, Miguel Angel Fiol. DAM, 69(3):271-279, 1996. [doi]

On the extraconnectivity of graphsJosep Fàbrega, Miguel Angel Fiol. DM, 155(1-3):49-57, 1996. [doi]

1994

On the distance connectivity of graphs and digraphsMiguel Angel Fiol, Josep Fàbrega. DM, 125(1-3):169-176, 1994. [doi]

Extraconnectivity of graphs with large girthJosep Fàbrega, Miguel Angel Fiol. DM, 127(1-3):163-170, 1994. [doi]

1993

A Unified Approach to the design and Control of Dynamic Memory NetworksMiguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra. ppl, 3:445-456, 1993.

1989

Maximally connected digraphsJosep Fàbrega, Miguel Angel Fiol. jgt, 13(6):657-668, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL