| SYS | | 0302049 |
|---|
| LBL | | -----naa--22--------450- |
|---|
| 005 | | 20231109092842.7 |
|---|
| 014 | | $a 000788413500009 $2 WOS CC. ESCI |
|---|
| 014 | | $a 2-s2.0-85114626408 $2 SCOPUS |
|---|
| 017 | 70 | $a 10.4067/S0719-06462021000200313 $2 DOI |
|---|
| 035 | | $a biblio/427983 $2 CREPC2 |
|---|
| 100 | | $a 20211005d2021 m y slo 03 ba |
|---|
| 101 | 0- | $a eng |
|---|
| 102 | | $a CL |
|---|
| 200 | 1- | $a A new class of graceful graphs: k-enriched fan graphs and their characterisations $f Miroslav Haviar, Samuel Kurtulík |
|---|
| 330 | | $a The 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. |
|---|
| 463 | -1 | $1 001 umb_un_cat*0302245 $1 011 $a 0716-7776 $1 011 $a 0719-0646 $1 200 1 $a Cubo $e a mathematical journal $v Vol. 23, č. 2 (2021), pp. 313-331 $1 210 $a Temuco $c Department of mathematics and statistics of the Universidad de La Frontera $d 2021 |
|---|
| 606 | 0- | $3 umb_un_auth*0039537 $a grafy $X charts $X graphs |
|---|
| 606 | 0- | $3 umb_un_auth*0130335 $a graciózne ohodnotenie grafov |
|---|
| 606 | 0- | $3 umb_un_auth*0289515 $a grafové šachovnice $X graph chessboards |
|---|
| 606 | 0- | $3 umb_un_auth*0086747 $a postupnosť |
|---|
| 608 | | $3 umb_un_auth*0273282 $a články $X journal articles |
|---|
| 700 | -0 | $3 umb_un_auth*0002686 $a Haviar $b Miroslav $p UMBFP10 $4 070 $9 50 $f 1965- $T Katedra matematiky |
|---|
| 701 | -1 | $3 umb_un_auth*0268235 $a Kurtulík $b Samuel $4 070 $9 50 |
|---|
| 801 | | $a SK $b BB301 $g AACR2 $9 unimarc sk |
|---|
| 856 | | $u http://cubo.ufro.cl/ $a Link na zdrojový dokument |
|---|
| 856 | | $u https://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462021000200313&lng=en&nrm=iso&tlng=en $a Link na plný text |
|---|
| T85 | | $x existuji fulltexy |
|---|
