Graceful labeling of an unconnected graph 3C₈m C₈m-1 G

MaRDI QIDQ5257166zbMATH OpenFDO

Authors Yuesheng Wu, Guangfu Wang, Baogen Xu

Publication date 29 June 2015

zbMATH Keywords

balanced bipartite graphgraceful labelingunconnected graph

Mathematics Subject Classification ID

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

Recommendations

• The graceful labeling of the unconnected graph \(C_{4m}\cup G\)
• Research on the graceful label of unconnected union graphs
• scientific article; zbMATH DE number 6501617
• On the gracefulness of the unconnected graphs 2C_m C_n P₂
• Research on the gracefulness of the unconnected graph \(C^{(2)}_{4k+1}\cup G_m\)

Cited in

(6)

• 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 6611724 (Why is no real title available?)
• The graceful labeling of the unconnected graph \(C_{4m}\cup G\)
• scientific article; zbMATH DE number 6501617 (Why is no real title available?)
• scientific article; zbMATH DE number 6402337 (Why is no real title available?)

This page was built for publication: Graceful labeling of an unconnected graph \(3C_{8m}\cup C_{8m-1}\cup G\)

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