Ara es mostren els items 50-69 de 138

    • Edge distance-regular graphs 

      Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
      Article
      Accés obert
      Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ...
    • Edge-distance-regular graphs 

      Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011-03-11)
      Report de recerca
      Accés obert
      Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ...
    • Edge-distance-regular graphs 

      Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2011)
      Article
      Accés restringit per política de l'editorial
      Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ...
    • Edge-distance-regular graphs are distance-regular 

      Cámara Vallejo, Marc; Dalfó Simó, Cristina; Delorme, Charles; Fiol Mora, Miquel Àngel; Suzuki, Hiroshi (2013)
      Article
      Accés restringit per política de l'editorial
      A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs ...
    • Eigenvalue interlacing and weight parameters of graphs 

      Fiol Mora, Miquel Àngel (Elsevier, 1999-03)
      Article
      Accés obert
      Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency ...
    • El diámetro de ciertos digrafos circulantes de triple paso 

      Morillo Bosch, M. Paz; Fiol Mora, Miquel Àngel (Universidad de Barcelona, Departamento de Estadística Matemática;Universidad Politécnica de Barcelona, Escuela Técnica Superior de Arquitectura, Departamento de Matemáticas y Estadística, 1986)
      Article
      Accés obert
      This paper studies some diameter-related properties of the $3$-step circulant digraphs with set of vertices $V=Z_N$ and steps $(\pm a,b)$. More precisely, it concentrates upon maximizing their order $N$ for any fixed ...
    • El diámetro de ciertos digrafos circulantes de triple paso 

      Fiol Mora, Miquel Àngel (1986)
      Article
      Accés obert
      This paper studies some diameter-related properties of the $3$-step circulant digraphs with set of vertices $V=Z_N$ and steps $(\pm a,b)$. More precisely, it concentrates upon maximizing their order $N$ for any fixed values ...
    • El espectro del digrafo mariposa 

      Comellas Padró, Francesc de Paula; Fiol Mora, Miquel Àngel; Gimbert, Joan; Mitjana Riera, Margarida (A. Márquez, 2002-09)
      Text en actes de congrés
      Accés obert
      La determinación del espectro de un grafo es de interés por la conexión que los autovalores y sus multiplicidades tienen con invariantes y propiedades topológicas del grafo, como el diámetro, conectividad, expansión, ...
    • El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2019)
      Article
      Accés obert
      En aquest treball es descriu un mètode numèric semi-discret per a la resolució d’un tipus d’equacions en derivades parcials. És conegut com el mètode de les línies (MOL, per les sigles en anglès), i es basa en la discretització ...
    • Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity 

      Fiol Mora, Miquel Àngel; Fàbrega Canudas, José; Diego Gutiérrez, Víctor (2020-09)
      Article
      Accés obert
      The spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the so-called predistance polynomials can be defined, as a generalization, for any graph, of the ...
    • Further topics in connectivity 

      Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
      Capítol de llibre
      Accés obert
      Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ...
    • General properties of c-circulant digraphs 

      Mora Giné, Mercè; Serra Albó, Oriol; Fiol Mora, Miquel Àngel (1988)
      Article
      Accés obert
      A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation ...
    • Grafos y teselaciones del plano 

      Fiol Mora, Miquel Àngel; Andrés Yebra, José Luís; Fiol, Maria Lluïsa (Universidad de Zaragoza (UZA), 1984)
      Comunicació de congrés
      Accés obert
    • Grafs, amics i coneguts 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2010)
      Article
      Accés obert
      Com és ben sabut, un graf és un objecte matemàtic que modelitza l’existència d’una certa relació entre parells d’elements d’un conjunt donat. Aleshores, és natural que molts dels primers resultats sobre grafs facin ...
    • Grafs, amics i coneguts 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2009-11-27)
      Report de recerca
      Accés obert
      Com és ben sabut, un graf no dirigit és un objecte matemàtic que modelitza l’existència d’una certa relació entre parells d’elements d’un conjunt donat. Aleshores, no és gaire sorprenent que, al començament, molts dels ...
    • Graphs, friends and acquaintances 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2018)
      Article
      Accés obert
      A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people. ...
    • Graphs, Friends and Acquaintances 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2010-04-23)
      Report de recerca
      Accés obert
      As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs ...
    • José Gómez Martí: in memoriam 1958-2014 

      Fiol Mora, Miquel Àngel (Societat Catalana de Matemàtiques (SCM), 2015-12)
      Altres
      Accés obert
      La vida és el que ens passa mentre fem altres plans (John Lennon)
    • Line digraph iterations and the (d,k) digraph problem 

      Fiol Mora, Miquel Àngel; Andrés Yebra, José Luis; Alegre de Miguel, Ignacio (1984-05)
      Article
      Accés restringit per política de l'editorial
      This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, ...
    • Load-balanced wavelength assignment strategies for optical burst/packet switching networks 

      Agustí Torra, Anna; Cervelló Pastor, Cristina; Fiol Mora, Miquel Àngel (2009-03)
      Article
      Accés restringit per política de l'editorial
      Loss-free schemes are defined to ensure successful packet/burst transmissions in optical packet/burst switching networks. To this end, they rely on a collision-free routing and wavelength assignment (CF-RWA) scheme ...