Graceful numbering of an edge-gluing of shell graphs
type: Item
instance of: scholarly article
title: Graceful numbering of an edge-gluing of shell graphs
zbMATH Open document ID: 0954.05042
DOI: 10.1016/S0012-365X(99)00360-X
author: G. Sethuraman
author: R. Dhavamani
published in: Discrete Mathematics
publication date: 2000-05-25T00:00:00Z
review text: Let \(u\) and \(v\) be two adjacent vertices in a cycle \(C_n\) of order \(n\) and let \(H(n,n-3)\) be the graph obtained by adding \(n-3\) chords incident with \(u\) in \(C_n\). The authors show that for each \(k\geq 1\) and \(n\geq 4\), the graph obtained by taking the union of \(k\) copies of \(H(n,n- 3)\) having the \(k\) edges \(uv\) identified is graceful. Reviewer's remark: Like almost all the previous papers on graceful graphs, there is absolutely no graph theory involved in this note.
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1453337
zbMATH Keywords: cycle
zbMATH Keywords: chords
zbMATH Keywords: graceful graphs
reviewed by: H. P. Yap
MaRDI profile type: Publication
Wikidata QID: Q127125102
description: scientific article; zbMATH DE number 1453337