On the gracefulness of (s C₄, 3) P_m

DOI10.16163/J.CNKI.22-1123/N.2016.01.005MaRDI QIDQ2990796zbMATH OpenFDO

Authors Yuesheng Wu

Publication date 10 August 2016

zbMATH Keywords

pathgraceful graphunconnected graphalternating graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the gracefulness of \( (s\langle c_4,n\rangle)\cup p_m\)
• On the gracefulness of graph \((jC_{4n})\cup P_m\)
• On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
• scientific article; zbMATH DE number 2188377
• On the gracefulness of the unconnected graphs \(2C_m\cup C_n\cup P_2\)

Cited in

(7)

• The gracefulness of \(C_{4k}\cup C_{4k}\cup P_{4k+t}\) (\(1\leq t\leq 3\))
• scientific article; zbMATH DE number 5943394 (Why is no real title available?)
• scientific article; zbMATH DE number 1504448 (Why is no real title available?)
• scientific article; zbMATH DE number 2188377 (Why is no real title available?)
• On the gracefulness of \( (s\langle c_4,n\rangle)\cup p_m\)
• Not all partial cubes are \(\Theta \)-graceful
• On the gracefulness of graph \((jC_{4n})\cup P_m\)

This page was built for publication: On the gracefulness of \((s\langle C_4, 3\rangle)\bigcup P_m\)

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