BibTex Citation Data :
@article{JM7087, author = {Isa Isa and Lucia Ratnasari}, title = {PELABELAN GRACEFUL SATU MODULO PADA BEBERAPA GRAF EULE}, journal = {Jurnal Matematika}, volume = {3}, number = {4}, year = {2014}, keywords = {odd-graceful labeling, one modulo graceful labeling, Euler graph, n polygonal snake, , .}, abstract = { ABSTRACT. A graph with edges is said to be one modulo graceful graph () if there is a injective function from vertex set of graph to in such a way that induces a function from edge set of graph to defined as is bijective. In this Last Project, the following Euler graphs : n -polygonal snakes, and under certain conditions which admit one modulo graceful labeling () are learned. }, url = {https://ejournal3.undip.ac.id/index.php/matematika/article/view/7087} }
Refworks Citation Data :
ABSTRACT. A graph with edges is said to be one modulo graceful graph () if there is a injective function from vertex set of graph to in such a way that induces a function from edge set of graph to defined as is bijective. In this Last Project, the following Euler graphs : n-polygonal snakes, and under certain conditions which admit one modulo graceful labeling () are learned.
Last update:
