On graceful and cordial labeling of shell graphs

MaRDI QIDQ5397254zbMATH OpenFDO

Authors

Publication date 19 February 2014

zbMATH Keywords

graceful labellinggraph labellingcordial labelling

Mathematics Subject Classification ID

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

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

Cited in

(8)

• One vertex union of shell graphs with a path at any common level is cordial
• scientific article; zbMATH DE number 1944633 (Why is no real title available?)
• On graceful and cordial labeling of shell graphs.
• scientific article; zbMATH DE number 2192201 (Why is no real title available?)
• Subdivided shell flower graphs: \(\rho\)-labeling
• scientific article; zbMATH DE number 5844223 (Why is no real title available?)
• 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)