Edge-odd graceful labelings of some prism and prism-like graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1338.05234
author: Ratinan Boonklurb
author: Sirirat Singhun
author: Akkaporn Wongpradit
publication date: 2016-02-23T00:00:00Z
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 6544900
zbMATH Keywords: edge-odd graceful labeling
zbMATH Keywords: Cartesian product of graphs
zbMATH Keywords: stars
zbMATH Keywords: wheels
MaRDI profile type: Publication
Recommended article: Q5087676
Recommended article: Graphs with edge-odd graceful labelings
Recommended article: Q4033000
Recommended article: Edge even graceful labeling of some graphs
Recommended article: Edge odd graceful labeling of some path and cycle related graphs
Recommended article: ODD GRACEFUL LABELINGS OF GRAPHS
Recommended article: Q3728945
Recommended article: Q3172582
Recommended article: Q4221698
Recommended article: Edge-graceful labelings of connected graphs
title: Edge-odd graceful labelings of some prism and prism-like graphs
published in: East-West Journal of Mathematics
review text: Given a graph \(G=(V,E)\) with \(q\) edges, an edge-odd graceful labeling is a bijection from \(V\) to \(\{1,3,\ldots, 2q-1\}\) such that when each vertex is assigned to the sum of the labels of all edges incident with it, all the vertex labels are different. In this paper, the authors give sufficient conditions for the following Cartesian products of graphs: \(S_n \square K_2\), \(S_n \square K_3\) and \(W_n \square K_2\), to have an edge-odd graceful labeling, where \(S_n\) is the star of order \(n+1\) and \(W_n\) is the wheel of order \(n+1\).
reviewed by: Daniela Ferrero
description: scientific article; zbMATH DE number 6544900