Recommendations
- The gracefulness of the join of graphs
- scientific article; zbMATH DE number 2191999
- Researches on gracefulness of graphs \((P^{(1)}_1\vee P_n)\cup (P^{(2)}_1\vee P_{2n})\) and \((P_2\vee \overline{K}_n)\cup G_{n-1}\)
- The graceful graphs on several kinds of union graphs
- The gracefulness of two kinds of unconnected graphs \((P_2\vee \overline{K_n})(0,0,r_1,0,\cdots ,0,r_n)\cup St(m)\) and \((P_2\vee \overline{K_n})(r_1+a,r_2,0,\cdots,0)\cup G_r\)
Cites work
Cited in
(5)
This page was built for publication: The gracefulness of the join of graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322012)