The graceful labeling of the unconnected graph (C₃_m) G

DOI10.13885/J.ISSN.0455-2059.2016.01.017zbMATH Open1363.05235MaRDI QIDQ2823978FDOQ2823978

Authors: Yuesheng Wu 

Publication date: 6 October 2016

Published in: Journal of Lanzhou University. Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

graceful labelingbalanced bipartite graphunconnected graphalternating graph

Mathematics Subject Classification ID

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

Cited In (5)

• The graceful labeling of the unconnected graphs \(C_{16}(r_1,0,r_2,0,\dots, r_8,0)\cup F_{k,4}\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The graceful labeling of the unconnected graph \((C_3\bigvee\overline{K_m})\bigcup G\)

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