• 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 ...
    • Large Edge-non-vulnerable Graphs 

      Delorme, Charles (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      In this paper we study the graphs such that the deletion of any edge does not increase the diameter. We give some upper bounds for the order of such a graph with given maximum degree and diameter. On the other hand ...