Open AccessSOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL
Author(s) -
Yeni Susanti,
Iwan Ernanto,
Aluysius Sutjijana,
Sufyan Sidiq
Publication year - 2021
Publication title -
journal of fundamental mathematics and applications
Language(s) - English
Resource type - Journals
eISSN - 2621-6035
pISSN - 2621-6019
DOI - 10.14710/jfma.v4i2.11607
Subject(s) - combinatorics , bijection , vertex (graph theory) , edge graceful labeling , mathematics , cartesian product , graph , simple graph , enhanced data rates for gsm evolution , connectivity , discrete mathematics , line graph , graph power , computer science , telecommunications
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its order and its size. Let $f$ be a bijective edge labeling which codomain is the set of odd integers from 1 up to $2q-1$. Then $f$ is called an edge odd graceful on $G$ if the weights of all vertices are distinct, where the weight of a vertex $v$ is defined as the sum $mod(2k)$ of all labels of edges incident to $v$. Any graph that admits an edge odd graceful labeling is called an edge odd graceful graph. In this paper, some new graph classes that are edge odd graceful are presented, namely some cartesian products of path of length two and some circular related graphs.