Sufyan Sidiq
Dept. of Mathematics, Gadjah Mada University

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL Yeni Susanti; Iwan Ernanto; Aluysius Sutjijana; Sufyan Sidiq
Journal of Fundamental Mathematics and Applications (JFMA) Vol 4, No 2 (2021)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1090.106 KB) | DOI: 10.14710/jfma.v4i2.11607

Abstract

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.