Search results

Records found: 3  
Your query: Author Sysno = "^umb_un_auth 0268235^"
  1. TitleA new class of graceful graphs: k-enriched fan graphs and their characterisations
    Author infoMiroslav Haviar, Samuel Kurtulík
    Author Haviar Miroslav 1965- (50%) UMBFP10 - Katedra matematiky
    Co-authors Kurtulík Samuel (50%)
    Source document Cubo : a mathematical journal. Vol. 23, č. 2 (2021), pp. 313-331. - Temuco : Department of mathematics and statistics of the Universidad de La Frontera, 2021
    Keywords grafy - charts - graphs   graciózne ohodnotenie grafov - graceful labelling of graphs   grafové šachovnice - graph chessboards   postupnosť  
    Form. Descr.články - journal articles
    LanguageEnglish
    CountryChile
    AnnotationThe Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory. The conjecture has caused a great interest in the study of gracefulness of simple graphs and has led to many new contributions to the list of graceful graphs. However, it has to be acknowledged that not much is known about the structure of graceful graphs after 55 years. Our paper adds an infinite family of classes of graceful graphs to the list of known simple graceful graphs. We introduce classes of k-enriched fan graphs kF_n for all integers k, n ≥ 2 and we prove that these graphs are graceful. Moreover, we provide characterizations of the k-enriched fan graphs kF_n among all simple graphs via Sheppard's labelling sequences introduced in the 1970s, as well as via labelling relations and graph chessboards. These last approaches are new tools for the study of graceful graphs introduced by Haviar and Ivaška in 2015. The labelling relations are closely related to Sheppard's labelling sequences while the graph chessboards provide a nice visualization of graceful labellings. We close our paper with an open problem concerning another infinite family of extended fan graphs.
    URLLink na zdrojový dokument Link na plný text
    Public work category ADM
    No. of Archival Copy50548
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
  2. TitleGraceful labellings of graphs
    Par.title[Graciózne ohodnotenia grafov]
    Subtitlediplomová práca
    Author infoSamuel Kurtulík; školiteľ: Miroslav Haviar
    Author Kurtulík Samuel
    Another authors Haviar Miroslav 1965- (Školiteľ (konzultant))
    Corporation Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko
    Issue dataBanská Bystrica , 2020. - 52 s.
    Keywords graciózne ohodnotenie grafov - graceful labelling of graphs   grafy - charts - graphs  
    Form. Descr.diplomové práce - master’s theses
    LanguageEnglish
    CountrySlovak Republic
    systematics 51
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexk - Kvalifikačné práce
    Copy count1, currently available 0, at library only 1
  3. TitleKonštrukcie v extremálnej teórii grafov
    Subtitlebakalárska práca
    Author infoSamuel Kurtulík; školiteľ: Štefan Gyürki
    Author Kurtulík Samuel
    Another authors Gyürki Štefan 1982- (Školiteľ (konzultant))
    Corporation Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko
    Issue dataBanská Bystrica , 2018. - 33 s.
    Keywords teória grafov - graph theory   matematika - mathematics  
    LanguageSlovak
    CountrySlovak Republic
    systematics 51
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexk - Kvalifikačné práce
    Copy count1, currently available 0, at library only 1


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.