Directed edge-graceful labeling of digraph consisting of c cycles of the same size

DOI10.1080/09720529.2021.1925448MaRDI QIDQ5865656zbMATH OpenOpenAlexFDO

Authors Ratinan Boonklurb, Natdawan Ruamkaew, Sirirat Singhun

Publication date 9 June 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2021.1925448

zbMATH Keywords

cycledigraph labelingdirected edge-graceful labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A class of diameter six trees exhibiting graceful labeling
• scientific article; zbMATH DE number 3863228 (Why is no real title available?)
• scientific article; zbMATH DE number 3910418 (Why is no real title available?)
• scientific article; zbMATH DE number 3961666 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• On Graceful Directed Graphs

Cited in

(2)

• Enumeration of connected components of acyclic digraph
• On k-super gracefulness of some complete multi-partite graphs

This page was built for publication: Directed edge-graceful labeling of digraph consisting of c cycles of the same size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865656)