The gracefulness of unconnected graph (P₂ K_n)(r₁,r₂,, r_n+2) G_r
From MaRDI portal
Publication:5260142
DOI10.11672/DBSDZK2014-03-008zbMATH Open1324.05180MaRDI QIDQ5260142FDOQ5260142
Authors: Yuesheng Wu, Guangfu Wang, Baogen Xu 
Publication date: 29 June 2015
Recommendations
- 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\)
- 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}\)
- 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)\)
- scientific article; zbMATH DE number 6401694
- On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
Cited In (5)
- 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\)
- On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
- Edge-gracefulness of the composition of paths with null graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The gracefulness of unconnected graph \((P_2\vee \overline{K}_n)(r_1,r_2,\dots, r_{n+2})\cup G_r\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260142)
