On graceful and cordial labeling of shell graphs

zbMATH Open1289.05426MaRDI QIDQ5397254FDOQ5397254

Authors:

Publication date: 19 February 2014

Recommendations

• On graceful and cordial labeling of shell graphs.
• One vertex union of shell graphs with a path at any common level is cordial
• Graceful and cordial labeling of subdivision of graphs
• scientific article; zbMATH DE number 1944633
• Subdivided shell flower graphs: \(\rho\)-labeling

zbMATH Keywords

graceful labellinggraph labellingcordial labelling

Mathematics Subject Classification ID

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

Cited In (8)

• One vertex union of shell graphs with a path at any common level is cordial
• Title not available (Why is that?)
• On graceful and cordial labeling of shell graphs.
• Title not available (Why is that?)
• Subdivided shell flower graphs: \(\rho\)-labeling
• Title not available (Why is that?)
• Double shells with two pendant edges at the apex are \(k\)-graceful
• One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial

This page was built for publication: On graceful and cordial labeling of shell graphs

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