- Characterizations of kites as graceful graphs
Počet záznamov: 1  

Characterizations of kites as graceful graphs

  1. NázovCharacterizations of kites as graceful graphs
    Aut.údajeMiroslav Haviar, Katarína Kotuľová
    Autor Haviar Miroslav 1965- (50%) UMBFP10 - Katedra matematiky
    Spoluautori Kotuľová Katarína (50%)
    Zdroj.dok. Cubo : a mathematical journal. Vol. 26, no 3 (2024), pp. 367-386. - Temuco : Department of mathematics and statistics of the Universidad de La Frontera, 2024
    Kľúč.slová grafy - charts - graphs   graciózne ohodnotenie grafov - graceful labelling of graphs   grafové šachovnice - graph chessboards  
    Form.deskr.články - journal articles
    Jazyk dok.angličtina
    KrajinaChile
    AnotáciaWe introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite. We study and characterize three classes of the kites: kites formed by cycles known to be graceful, fan kites and lantern kites. Beside showing in a transparent way that all these graphs are graceful, we provide characterizations of these graphs among all simple graphs via three tools: via Sheppard's labelling sequences introduced in the 1970s and via labelling relations and graph chessboards. The latter are relatively 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 the graceful labellings.
    URLLink na plný text
    Kategória publikačnej činnosti ADM
    Číslo archívnej kópie55236
    Katal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Báza dátxpca - PUBLIKAČNÁ ČINNOSŤ
    OdkazyPERIODIKÁ-Súborný záznam periodika
    článok

    článok

Počet záznamov: 1  

  Tieto stránky využívajú súbory cookies, ktoré uľahčujú ich prezeranie. Ďalšie informácie o tom ako používame cookies.