The balanced labeling of the unconnected graph C₈(r₁,0,r₂,0,, 0) G

DOI10.3969/J.ISSN.1000-2162.2014.01.003MaRDI QIDQ2924722zbMATH OpenFDO

Authors Yuesheng Wu, Guangfu Wang, Baogen Xu

Publication date 3 November 2014

Published in Journal of Anhui University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

graceful graphbalanced bipartite graphunconnected graph

Mathematics Subject Classification ID

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

Recommendations

• 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\)
• scientific article; zbMATH DE number 6611724
• The graceful labeling of the unconnected graph \(C_{11}(r_1,0,r_2,0,r_3,0,\dots, 0)\cup G\)
• Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
• scientific article; zbMATH DE number 6402337
• The graceful labeling of the unconnected graph \(C_{4m}\cup G\)
• scientific article; zbMATH DE number 6501617
• scientific article; zbMATH DE number 6452959
• scientific article; zbMATH DE number 6500994

Cited in

(2)

• The balanced properties of bipartite graphs with applications
• The balanced labeling of Cartesian product graphs

This page was built for publication: The balanced labeling of the unconnected graph \(C_8(r_1,0,r_2,0,\dots, 0)\cup G\)

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