2021
DOI: 10.14710/jfma.v4i2.11607
|View full text |Cite
|
Sign up to set email alerts
|

Some Cartesian Products of a Path and Prism Related Graphs That Are Edge Odd Graceful

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 13 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?