The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Miguel Angel Fiol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Miguel Angel Fiol, Oriol Serra
    An Algebraic Model for the Storage of Data in Parallel Memories. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:238-246 [Conf]
  2. Paz Morillo, Miguel Angel Fiol, J. Guitart
    On the (d, D, D, s) - Digraph Problem. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:334-340 [Conf]
  3. Miguel Angel Fiol, Ignacio Alegre, J. Luis A. Yebra
    Line Digraph Iterations and the (d,k) Problem for Directed Graphs [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:174-177 [Conf]
  4. Miguel Angel Fiol
    Quasi-Spectral Characterization of Strongly Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  5. Miguel Angel Fiol
    Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  6. Miguel Angel Fiol
    An Eigenvalue Characterization of Antipodal Distance Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  7. Miguel Angel Fiol
    Some Spectral Characterizations Of Strongly Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:2, pp:- [Journal]
  8. Miguel Angel Fiol
    A General Spectral Bound For Distant Vertex Subsets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:1, pp:- [Journal]
  9. Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra
    On Twisted Odd Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:3, pp:- [Journal]
  10. Francesc Comellas, Miguel Angel Fiol
    Vertex-symmetric Digraphs with Small Diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:1, pp:1-11 [Journal]
  11. Josep Fàbrega, Miguel Angel Fiol
    Bipartite Graphs and Digraphs with Maximum Connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:271-279 [Journal]
  12. Miguel Angel Fiol, Ernest Garriga
    The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:77-97 [Journal]
  13. José Gómez, Miguel Angel Fiol, J. Luis A. Yebra
    Graphs on Alphabets as Models for Large Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:227-243 [Journal]
  14. Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra
    Boundary graphs: The limit case of a spectral property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:155-173 [Journal]
  15. Miguel Angel Fiol
    Algebraic characterizations of distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:246, n:1-3, pp:111-129 [Journal]
  16. Miguel Angel Fiol, Ernest Garriga
    On the spectrum of an extremal graph with four eigenvalues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2241-2244 [Journal]
  17. Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
    Cayley Digraphs from Complete Generalized Cycles. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:5, pp:337-349 [Journal]
  18. Josep M. Brunat, Miguel Angel Fiol, Montserrat Maureso
    Chromatic Automorphisms of Consecutive Digraphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:2, pp:145-159 [Journal]
  19. Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana
    Weakly distance-regular digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:233-255 [Journal]
  20. Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra
    On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:1, pp:48-61 [Journal]
  21. Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra
    Locally Pseudo-Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:179-205 [Journal]
  22. Miguel Angel Fiol, E. Carriga
    From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:162-183 [Journal]
  23. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    On the connectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:2, pp:97-105 [Journal]
  24. Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana
    The spectra of wrapped butterfly digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:15-19 [Journal]
  25. Francesc Comellas, Miguel Angel Fiol, José Gómez
    On Large Vertex Symmetric 2-Reachable Digraphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:379-384 [Journal]
  26. Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra
    A Unified Approach to the design and Control of Dynamic Memory Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:445-456 [Journal]
  27. Miguel Angel Fiol, Ernest Garriga
    An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:1-13 [Journal]
  28. Miguel Angel Fiol, Anna S. Lladó
    The Partial Line Digraph Technique in the Design of Large Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:7, pp:848-857 [Journal]
  29. Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre, Mateo Valero
    A Discrete Optimization Problem in Local Networks and Data Alignment. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:6, pp:702-713 [Journal]
  30. Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel
    Line Digraph Iterations and the (d, k) Digraph Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:5, pp:400-403 [Journal]
  31. Tomás Lang, Mateo Valero, Miguel Angel Fiol
    Reduction of Connections for Multibus Organization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:8, pp:707-716 [Journal]
  32. Carles Padró, Paz Morillo, Miguel Angel Fiol
    Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:768- [Journal]
  33. Miguel Angel Fiol
    Congruences in Zn, finite Abelian groups and the Chinese remainder theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:1, pp:101-105 [Journal]
  34. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Superconnectivity of bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:61-75 [Journal]
  35. Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra
    Boundary graphs - II The limit case of a spectral property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:101-111 [Journal]
  36. Josep M. Brunat, Miguel Angel Fiol, M. L. Fiol
    Digraphs on permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:174, n:1-3, pp:73-86 [Journal]
  37. M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    On the order and size of s-geodetic digraphs with given connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:174, n:1-3, pp:19-27 [Journal]
  38. M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Connectivity of large bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:174, n:1-3, pp:3-17 [Journal]
  39. Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra
    The alternating polynomials and their relation with the spectra and conditional diameters of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:297-307 [Journal]
  40. F. Aguiló, M. A. Fiol, C. Garcia
    Triple loop networks with small transmission delay. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:3-16 [Journal]
  41. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Extraconnectivity of graphs with large minimum degree and girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:85-100 [Journal]
  42. J. Gómez, Miguel Angel Fiol, Oriol Serra
    On large (Delta, D)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:219-235 [Journal]
  43. P. Esqué, F. Aguiló, M. A. Fiol
    Double commutative-step digraphs with minimum diameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:147-157 [Journal]
  44. Miguel Angel Fiol
    On congruence in Zn and the dimension of a multidimensional circulant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:123-134 [Journal]
  45. Josep Fàbrega, Miguel Angel Fiol
    On the extraconnectivity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:155, n:1-3, pp:49-57 [Journal]
  46. F. Aguiló, M. A. Fiol
    An efficient algorithm to find optimal double loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:15-29 [Journal]
  47. Josep M. Brunat, Margarida Espona, Miguel Angel Fiol, Oriol Serra
    On Cayley line digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:147-159 [Journal]
  48. Miguel Angel Fiol
    The superconnectivity of large digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:124, n:1-3, pp:67-78 [Journal]
  49. Miguel Angel Fiol, Josep Fàbrega
    On the distance connectivity of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:169-176 [Journal]
  50. Josep Fàbrega, Miguel Angel Fiol
    Extraconnectivity of graphs with large girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:163-170 [Journal]

  51. A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks. [Citation Graph (, )][DBLP]


  52. Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings. [Citation Graph (, )][DBLP]


  53. On the fairness issue in OBS loss-free schemes. [Citation Graph (, )][DBLP]


  54. The hierarchical product of graphs. [Citation Graph (, )][DBLP]


  55. The generalized hierarchical product of graphs. [Citation Graph (, )][DBLP]


  56. Number of walks and degree powers in a graph. [Citation Graph (, )][DBLP]


  57. The local spectra of regular line graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002