Gracefulness of unconnected graphs (P₁ P_n) G_r, (P₁ P_n) (P₃ K_r) and W_n St (m)
From MaRDI portal
Publication:3501346
zbMATH Open1150.05395MaRDI QIDQ3501346FDOQ3501346
Authors: Hua Cai, Lixia Wei, Xianrui Lü 
Publication date: 3 June 2008
Recommendations
- scientific article; zbMATH DE number 6401694
- 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 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\)
- scientific article; zbMATH DE number 5584819
- On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
Cited In (11)
- The gracefulness of unconnected graphs \((P_3\vee \overline{K_m}) \cup G\) and \((C_3 \vee \overline{K_m}) \cup G\)
- 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\)
- The gracefulness of unconnected graph \((P_2\vee \overline{K}_n)(r_1,r_2,\dots, r_{n+2})\cup G_r\)
- On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
- Research on the graceful label of unconnected union graphs
- Title not available (Why is that?)
- Gracefulness of several unconnected graphs with wheel
- Title not available (Why is that?)
- Gracefulness of the graphs related to wheel
- The graceful graphs on several kinds of union graphs
- 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}\)
This page was built for publication: Gracefulness of unconnected graphs \( (P_1\vee P_n)\cup G_r, (P_1 \vee P_n)\cup (P_3 \vee \Bar{K}_r)\) and \(W_n\cup St (m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501346)
