Logotipo del repositorio
Repositorio institucional
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Iniciar sesión
    ¿Nuevo Usuario? Pulse aquí para registrarse¿Has olvidado tu contraseña?
Logotipo del repositorio
  • REPOSITORIO INSTITUCIONAL - UNH
  • Comunidades
  • Todo DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Iniciar sesión
    ¿Nuevo Usuario? Pulse aquí para registrarse¿Has olvidado tu contraseña?
  1. Inicio
  2. Buscar por autor

Examinando por Autor "Atoche Bravo, María Jacqueline"

Mostrando 1 - 2 de 2
Resultados por página
Opciones de ordenación
  • No hay miniatura disponible
    Ítem
    Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs
    (Universal Wiser Publisher PTE. LTD., 2025-01-21) Berrocal Huamani, Nelson; Atoche Bravo, María Jacqueline; Poma, F.
    We say that a tree is a spider if has at most one vertex of degree greater than two. We obtain existence of families of gracefuls spiders with ℓ(2k +1)−k, ℓ(2k +1)−k +1 and ℓ(2k +1)+k +1 legs. We provide specific labels for each spider graph, these labels are constructed from graceful path graphs that have a particular label, so there is acorrespondence between some paths and graceful spiders that we are studying, this correspondence is described in an algorithm outlined in the preliminaries.
  • No hay miniatura disponible
    Ítem
    Families of gracefuls spiders with 3l, 3l+2 and 3l-1 legs
    (Universal Wiser Publisher PTE. LTD., 2024-11-07) Berrocal Huamani, Nelson; Atoche Bravo, María Jacqueline
    We say that a tree is a spider if has at most one vertex of degree greater than two. We prove the existence of families of graceful spiders with 3ℓ, 3ℓ+2 and 3ℓ−1 legs. We provide specific labels for each spider graph, these labels are constructed from graceful path graphs that have a particular label, so there is a correspondence between some paths and graceful spiders that we are studying, this correspondence is described in an algorithm outlined in the preliminaries.

Repositorio Institucional Universidad Nacional de Huancavelica

Jr. Victoria Garma Nº 330

Jr. Hipólito Unánue Nº 209

Contacto: repositorio@unh.edu.pe

Copyright © 2002-2025

Todos los derechos reservados

Software Dspace 7.5

Declaración de BerlinImage
Espacio bajo licenciaImage

  • Configuración de cookies
  • Política de privacidad
  • Acuerdo de usuario final
  • Enviar Sugerencias