J. Fàbrega

950 total citations
26 papers, 671 citations indexed

About

J. Fàbrega is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, J. Fàbrega has authored 26 papers receiving a total of 671 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 17 papers in Computer Networks and Communications and 13 papers in Geometry and Topology. Recurrent topics in J. Fàbrega's work include Advanced Graph Theory Research (17 papers), Interconnection Networks and Systems (16 papers) and Graph theory and applications (13 papers). J. Fàbrega is often cited by papers focused on Advanced Graph Theory Research (17 papers), Interconnection Networks and Systems (16 papers) and Graph theory and applications (13 papers). J. Fàbrega collaborates with scholars based in Spain. J. Fàbrega's co-authors include M.A. Fiol, C. Balbuena, Ángeles Carmona Mejías, E. Garriga, X. Marcote, Ignacio M. Pelayo, J.L.A. Yebra, Jaume Martí-Farré, Oriol Serra and Xavier Muñoz and has published in prestigious journals such as Networks, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

J. Fàbrega

22 papers receiving 647 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
J. Fàbrega Spain	11	589	339	214	194	101	26	671
Marc J. Lipman United States	14	462 0.8×	269 0.8×	128 0.6×	118 0.6×	79 0.8×	33	556
Zhizhang Shen United States	13	454 0.8×	158 0.5×	198 0.9×	127 0.7×	52 0.5×	66	513
Jung-Heum Park South Korea	18	840 1.4×	588 1.7×	467 2.2×	79 0.4×	33 0.3×	56	928
Junming Xu China	3	419 0.7×	218 0.6×	229 1.1×	97 0.5×	48 0.5×	4	515
Jinn‐Shyong Yang Taiwan	17	625 1.1×	265 0.8×	391 1.8×	58 0.3×	39 0.4×	32	652
Toru Araki Japan	12	270 0.5×	192 0.6×	128 0.6×	47 0.2×	21 0.2×	32	372
Kung-Jui Pai Taiwan	12	367 0.6×	104 0.3×	205 1.0×	29 0.1×	24 0.2×	42	417
Meijie Ma China	17	834 1.4×	309 0.9×	503 2.4×	74 0.4×	73 0.7×	45	856
Chang‐Hsiung Tsai Taiwan	19	871 1.5×	323 1.0×	483 2.3×	111 0.6×	36 0.4×	43	895
Chin-Wen Ho Taiwan	10	348 0.6×	230 0.7×	146 0.7×	23 0.1×	18 0.2×	26	451

Countries citing papers authored by J. Fàbrega

Since Specialization

Citations

This map shows the geographic impact of J. Fàbrega's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by J. Fàbrega with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Fàbrega more than expected).

Fields of papers citing papers by J. Fàbrega

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J. Fàbrega. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by J. Fàbrega. The network helps show where J. Fàbrega may publish in the future.

Co-authorship network of co-authors of J. Fàbrega

This figure shows the co-authorship network connecting the top 25 collaborators of J. Fàbrega. A scholar is included among the top collaborators of J. Fàbrega based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with J. Fàbrega. J. Fàbrega is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fàbrega, J., Jaume Martí-Farré, & Xavier Muñoz. (2021). Uniform forcing and immune sets in graphs and hypergraphs. Discrete Applied Mathematics. 305. 23–33.

Dalfó, C., et al.. (2011). Edge-distance-regular graphs. Journal of Combinatorial Theory Series A. 118(7). 2071–2091. 3 indexed citations

Dalfó, C., et al.. (2011). Edge-distance-regular graphs. Electronic Notes in Discrete Mathematics. 38. 221–226. 2 indexed citations

Fàbrega, J., et al.. (2010). Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes. The Electronic Journal of Combinatorics. 17(1).

Marcote, X., C. Balbuena, Ignacio M. Pelayo, & J. Fàbrega. (2005). (δ,g)-cages with g⩾10 are 4-connected. Discrete Mathematics. 301(1). 124–136. 10 indexed citations

Pelayo, Ignacio M., X. Marcote, C. Balbuena, & J. Fàbrega. (2002). Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discrete Mathematics. 267(1-3). 229–246. 2 indexed citations

Fàbrega, J., et al.. (2002). Superconnected digraphs and graphs with small conditional diameters. Networks. 39(3). 153–160. 10 indexed citations

Balbuena, C., Ángeles Carmona Mejías, J. Fàbrega, & M.A. Fiol. (1999). Superconnectivity of bipartite digraphs and graphs. Discrete Mathematics. 197-198. 61–75. 6 indexed citations

Balbuena, C., Ángeles Carmona Mejías, J. Fàbrega, & M.A. Fiol. (1997). On the order and size of s-geodetic digraphs with given connectivity. Discrete Mathematics. 174(1-3). 19–27. 22 indexed citations

10.

Balbuena, C., Ángeles Carmona Mejías, J. Fàbrega, & M.A. Fiol. (1997). Extraconnectivity of graphs with large minimum degree and girth. Discrete Mathematics. 167-168. 85–100. 18 indexed citations

11.

Balbuena, C., Ángeles Carmona Mejías, J. Fàbrega, & M.A. Fiol. (1997). Connectivity of large bipartite digraphs and graphs. Discrete Mathematics. 174(1-3). 3–17. 7 indexed citations

12.

Fàbrega, J., et al.. (1997). Fault-tolerant routings in double fixed-step networks. Discrete Applied Mathematics. 78(1-3). 61–74. 14 indexed citations

13.

Fàbrega, J. & M.A. Fiol. (1996). On the extraconnectivity of graphs. Discrete Mathematics. 155(1-3). 49–57. 284 indexed citations

14.

Fàbrega, J. & M.A. Fiol. (1996). Bipartite graphs and digraphs with maximum connectivity. Discrete Applied Mathematics. 69(3). 271–279. 26 indexed citations

15.

Fàbrega, J. & M.A. Fiol. (1994). Extraconnectivity of graphs with large girth. Discrete Mathematics. 127(1-3). 163–170. 112 indexed citations

16.

Fiol, M.A. & J. Fàbrega. (1994). On the distance connectivity of graphs and digraphs. Discrete Mathematics. 125(1-3). 169–176. 8 indexed citations

17.

Fiol, M.A., J. Fàbrega, Oriol Serra, & J.L.A. Yebra. (1993). A UNIFIED APPROACH TO THE DESIGN AND CONTROL OF DYNAMIC MEMORY NETWORKS. Parallel Processing Letters. 3(4). 445–456. 4 indexed citations

18.

Fàbrega, J. & M.A. Fiol. (1989). Maximally connected digraphs. Journal of Graph Theory. 13(6). 657–668. 105 indexed citations

19.

Fiol, M.A., et al.. (1985). Digraphs with walks of equal length between vertices. John Wiley & Sons, Inc. eBooks. 313–322. 10 indexed citations

20.

Fàbrega, J., et al.. (1983). Some compound graphs.. 7(2). 137–143. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact