Number of the records: 1
Characterizations of kites as graceful graphs
Title Characterizations of kites as graceful graphs Author info Miroslav Haviar, KatarÃna Kotuľová Author Haviar Miroslav 1965- (50%) UMBFP10 - Katedra matematiky
Co-authors Kotuľová KatarÃna (50%)
Source document 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 Keywords grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs grafové šachovnice - graph chessboards Form. Descr. Älánky - journal articles Language English Country Chile Annotation We 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. URL Link na plný text Public work category ADM No. of Archival Copy 55236 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika 
article
Number of the records: 1