Exploració per tema "Cayley graphs"

Ara es mostren els items 1-5 de 5

    • Amenability and Thompson’s group F 

      Acedo Moscoso, Diego (Universitat Politècnica de Catalunya, 2019-10)
      Projecte Final de Màster Oficial
      Accés obert
      Amenability is a group theoretical property consisting in the existence of a finite measure defined on all subsets of the group. The concept is motivated and introduced, and some criteria, characterizations and generalizations ...

    • Large digraphs of given diameter and degree from coverings 

      Ždímalová, Mária; Staneková, Lubica (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      We show that a construction of Comellas and Fiol for large vertex-transitive digraphs of given degree and diameter from small digraphs preserves the properties of being a Cayley digraph and being a regular covering.

    • Large graphs of diameter two and given degree 

      Širáň, Jozef; Siagiová, Jana; Ždímalová, Mária (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a regular graph, a Cayley graph, and a Cayley graph of an Abelian group, respectively, of diameter 2 and degree d. The best currently known lower bounds on these ...

    • Topology of Cayley graphs applied to inverse additive problems 

      Hamidoune, Yahya Ould (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      We present the basic isopermetric structure theory, obtaining some new simplified proofs. Let 1 ≤ r ≤ k be integers. As an application, we obtain simple descriptions for the subsets S of an abelian group with |kS| ≤ ...

    • Vertex-transitive graphs that remain connected after failure of a vertex an its neighbors 

      Hamidoune, Yahya Ould; Lladó Sánchez, Ana M.; López Masip, Susana Clara (Wiley InterScience, 2010)
      Article
      Accés restringit per política de l'editorial
      A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ...