Exploració per autor "Fiol Mora, Miquel Àngel"Més informacióMés informació

Ara es mostren els items 43-62 de 139

    • Decompositions of a rectangle into non-congruent rectangles of equal area 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; López Lorenzo, Nacho; Martínez Pérez, Álvaro (2021-06)
      Article
      Accés obert
      In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into k non-congruent rectangles of equal area? This problem is motivated by the so-called ‘Mondrian art problem’ that asks a ...

    • Deterministic hierarchical networks 

      Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2016)
      Article
      Accés obert
      It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and also scale-free (the degrees are distributed according ...

    • Deterministic hierarchical networks 

      Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007-11-20)
      Article
      Accés obert
      Recently it has been shown that many networks associated with complex systems are small-world (they have both a large local clustering and a small diameter) and they are also scale-free (the degrees are distributed according ...

    • Digraphs with walks of equal length between vertices 

      Fiol Mora, Miquel Àngel; Alegre, Ignasi; Andrés Yebra, José Luís; Fàbrega Canudas, José (1984)
      Text en actes de congrés
      Accés obert

    • Discovering important nodes of complex networks based on laplacian spectra 

      Moradi Amani, Ali; Fiol Mora, Miquel Àngel; Jalili, Mahdi; Chen, Guanrong; Yu, Xinghuo; Stone, Lewi (2023-08-31)
      Article
      Accés obert
      Knowledge of the Laplacian eigenvalues of a network provides important insights into its structural features and dynamical behaviours. Node or link removal caused by possible outage events, such as mechanical and electrical ...

    • Distance mean-regular graphs 

      Fiol Mora, Miquel Àngel; Diego, Victor (2016)
      Article
      Accés obert
      We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V , diameter D, adjacency matrix A, and ...

    • Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues 

      Fiol Mora, Miquel Àngel; Brouwer, Andries (Elsevier, 2015)
      Article
      Accés obert
      Let the Kneser graph K of a distance-regular graph $\Gamma$ be the graph on the same vertex set as $\Gamma$, where two vertices are adjacent when they have maximal distance in $\Gamma$. We study the situation where the ...

    • Dual concepts of almost distance-regularity and the spectral excess theorem 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Dam, Edwin R. van (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily all, regularity properties that characterize distance-regular graphs. In this paper we first propose two dual concepts ...

    • 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 ...