| 2009 |
|---|
| 14 | EE | J. Gómez:
Some new large (delta, 3)-graphs.
Networks 53(1): 1-5 (2009) |
| 2008 |
|---|
| 13 | EE | J. Gómez:
Two new methods to obtain super vertex-magic total labelings of graphs.
Discrete Mathematics 308(15): 3361-3372 (2008) |
| 2007 |
|---|
| 12 | EE | J. Gómez:
Solution of the conjecture: If n=0(mod 4), n>4, then Kn has a super vertex-magic total labeling.
Discrete Mathematics 307(21): 2525-2534 (2007) |
| 11 | EE | J. Gómez:
Large vertex symmetric digraphs.
Networks 50(4): 241-250 (2007) |
| 10 | EE | A. Márquez,
Consolación Gil,
Raul Baños,
J. Gómez:
Improving the Performance of Multi-Objective Evolutionary Algorithms Using the Island Parallel Model.
Parallel Processing Letters 17(2): 127-139 (2007) |
| 2006 |
|---|
| 9 | EE | Consolación Gil,
Raul Baños,
Maria Dolores Gil Montoya,
J. Gómez:
Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning.
Algorithmic Operations Research 1(1): (2006) |
| 2003 |
|---|
| 8 | EE | J. Gómez,
Ignacio M. Pelayo,
Camino Balbuena:
Diameter vulnerability of GC graphs.
Discrete Applied Mathematics 130(3): 395-416 (2003) |
| 2002 |
|---|
| 7 | EE | Camino Balbuena,
Ignacio M. Pelayo,
J. Gómez:
On the superconnectivity of generalized p-cycles.
Discrete Mathematics 255(1-3): 13-23 (2002) |
| 6 | EE | Charles Delorme,
J. Gómez:
Some New Large Compound Graphs.
Eur. J. Comb. 23(5): 539-547 (2002) |
| 2001 |
|---|
| 5 | | Ignacio M. Pelayo,
Camino Balbuena,
J. Gómez:
On the connectivity of generalized p-cycles.
Ars Comb. 58: (2001) |
| 1999 |
|---|
| 4 | EE | J. Gómez,
M. Escudero:
Optimal edge coloring of large graphs.
Networks 34(1): 61-65 (1999) |
| 3 | EE | J. Gómez,
Ignacio M. Pelayo,
Camino Balbuena:
New large graphs with given degree and diameter six.
Networks 34(2): 154-161 (1999) |
| 1998 |
|---|
| 2 | | J. Gómez,
M. Escudero:
Edge-Colorings of Some Large Graphs on Alphabets.
Ars Comb. 49: (1998) |
| 1993 |
|---|
| 1 | EE | J. Gómez,
Miguel Angel Fiol,
Oriol Serra:
On large (Delta, D)-graphs.
Discrete Mathematics 114(1-3): 219-235 (1993) |
