Repositorio Dspace

Listar Doctorado en Ciencias Básicas por autor "132236"

Listar Doctorado en Ciencias Básicas por autor "132236"

Ordenar por:Orden:Resultados:

  • Hamiltonicity of token graphs of fan graphs 
    Rivera Martínez, Luis Manuel; Trujillo-Negrete, Ana Laura (Slovenian Discrete and Applied Mathematics Society and the University of Primorska, FAMNIT., 2018)
    In this note we show that the token graphs of fan graphs are Hamiltonian. This result provides another proof of the Hamiltonicity of Johnson graphs and also extends previous results obtained by Mirajkar and Priyanka on ...
  • Independence and matching number for some token graphs 
    de Alba, Hernán; Carballosa, Walter; Leaños, Jesús; Rivera Martínez, Luis Manuel (Combinatorial Mathematics Society of Australasia (CMSA) by The University of Queensland, 2020)
    Let G be a graph of order n and let k ∈ {1, . . . , n−1}. The k-token graph Fk(G) of G is the graph whose vertices are the k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is ...
  • On Pillai's problem with the Fibonacci and Pell sequences 
    Hernández Hernández, Santos; Florian, Luca; Rivera Martínez, Luis Manuel (SPRINGER, 2019)
    Let (Fn)n≥0 and (Pn)n≥0 be the Fibonacci and Pell sequences given by the initial conditions F0 = 0, F1 = 1, P0 = 0, P1 = 1 and the recurrence formulas Fn+2 = Fn+1 + Fn, Pn+2 = 2Pn+1 + Pn for all n ≥ 0, respectively. In ...
  • The packing number of the double vertex graph of the path graph 
    Gómez Soto, José Manuel; Leaños, Jesús; Ríos Castro, Luis Manuel; Rivera Martínez, Luis Manuel (Elsevier, 2018)
    Neil Sloane showed that the problem of determining the maximum size of a binary code of constant weight 2 that can correct a single adjacent transposition is equivalent to finding the packing number of a certain graph. ...

Buscar en DSpace


Búsqueda avanzada

Listar

Mi cuenta