Exploració per autor "Cámara Vallejo, Marc"

Ara es mostren els items 1-7 de 7

    • Combinatorial vs. algebraic characterizations of pseudo-distance-regularity around a set 

      Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2009-06)
      Report de recerca
      Accés obert
      Given a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regularity around $C$ generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to now, most ...

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

    • On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes 

      Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2014-10-30)
      Article
      Accés restringit per política de l'editorial
      In this paper we study the relation between the local spectrum of a vertex set C and the local spectra of its subconstituents. In particular, it is shown that, when C is a completely regular code, such spectra are uniquely ...

    • Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes 

      Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Fàbrega Canudas, José; Cámara Vallejo, Marc (2000-08)
      Article
      Accés obert
      We present some related families of orthogonal polynomials of a discrete variable and survey some of their applications in the study of (distance-regular) graphs and (completely regular) codes. One of the main peculiarities ...