Graceful labelings -- properties and algorithms

zbMATH Open1284.05192MaRDI QIDQ3172284FDOQ3172284

Authors: Jay Bagga 

Publication date: 5 October 2011

Recommendations

• An algorithm for graceful labelings of cycles
• Properties of graceful labelings of cycles
• The graceful label of graphs \(C_n\) and \(1C_n\)
• On some variants of gracefulness of cycle graphs.
• A generating algorithm for all graceful labelings of graceful graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (19)

• A generating algorithm for all graceful labelings of graceful graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some variants of gracefulness of cycle graphs.
• On graceful chain graphs
• The graceful label of graphs \(C_n\) and \(1C_n\)
• Title not available (Why is that?)
• The graceful labeling of two types graphs is constituted by cycles of length four
• Title not available (Why is that?)
• Gracefulness in the path union of vertex switching of even cycles in increasing order
• Graceful labelings of unicyclic graphs
• New classes of graceful unicyclic graphs
• Graceful and cordial labeling of subdivision of graphs
• One curious identity counting graceful labelings
• New graceful labellings of the \(n\)-cycle \(C_n\) and it's \(r\)-crowns
• An algorithm for graceful labelings of cycles
• Properties of graceful labelings of cycles
• Pseudograceful labelings of cycles.
• Graceful labeling algorithms and complexity -- a survey

This page was built for publication: Graceful labelings -- properties and algorithms

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