The graceful labeling of two kinds of graphs and their coronas
From MaRDI portal
Publication:3175326
DOI10.16163/J.CNKI.22-1123/N.2017.03.031zbMATH Open1399.05196MaRDI QIDQ3175326FDOQ3175326
Authors: Baoxiang Tang, Han Ren
Publication date: 18 July 2018
Recommendations
- Graceful labeling of the corona for two kinds of graceful 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}\)
- Graceful labeling of the union of some graphs
- On the gracefulness of the \( (G_{r_1},G_{r_2},\cdots, G_{r_{4h+2}})\)-corona of the graph \(C_{4h+1}\odot K_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\)
Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (1)
This page was built for publication: The graceful labeling of two kinds of graphs and their coronas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3175326)