The graceful labeling of the unconnected graph C₄m G

DOI10.11721/CQNUJ20150216MaRDI QIDQ3196128zbMATH OpenFDO

Authors Yuesheng Wu

Publication date 28 October 2015

Full work available at URL https://doi.org/10.11721/CQNUJ20150216

zbMATH Keywords

balanced bipartite graphgraceful graphgraceful labelingunconnected graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6402337
• scientific article; zbMATH DE number 6501617
• The graceful labeling of the unconnected graphs \(C_{16}(r_1,0,r_2,0,\dots, r_8,0)\cup F_{k,4}\)
• Graceful labeling of an unconnected graph \(3C_{8m}\cup C_{8m-1}\cup G\)
• Research on the gracefulness of the unconnected graph \(C^{(2)}_{4k+1}\cup G_m\)

Cited in

(8)

• On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
• The balanced labeling of the unconnected graph C₈(r₁,0,r₂,0,, 0) G
• The graceful labeling of the unconnected graphs \(C_{16}(r_1,0,r_2,0,\dots, r_8,0)\cup F_{k,4}\)
• scientific article; zbMATH DE number 6611037 (Why is no real title available?)
• scientific article; zbMATH DE number 6611724 (Why is no real title available?)
• scientific article; zbMATH DE number 6501617 (Why is no real title available?)
• Graceful labeling of an unconnected graph \(3C_{8m}\cup C_{8m-1}\cup G\)
• scientific article; zbMATH DE number 6402337 (Why is no real title available?)

This page was built for publication: The graceful labeling of the unconnected graph \(C_{4m}\cup G\)

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