Recommendations
- The gracefulness of the join of graphs. II
- 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}\)
- scientific article; zbMATH DE number 2191999
- On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)
Cites work
- scientific article; zbMATH DE number 3815700 (Why is no real title available?)
- scientific article; zbMATH DE number 4027521 (Why is no real title available?)
- scientific article; zbMATH DE number 1382493 (Why is no real title available?)
- scientific article; zbMATH DE number 3655996 (Why is no real title available?)
- scientific article; zbMATH DE number 3698968 (Why is no real title available?)
- scientific article; zbMATH DE number 3762115 (Why is no real title available?)
- scientific article; zbMATH DE number 3458691 (Why is no real title available?)
- scientific article; zbMATH DE number 3616482 (Why is no real title available?)
- scientific article; zbMATH DE number 2076913 (Why is no real title available?)
- scientific article; zbMATH DE number 2188386 (Why is no real title available?)
- scientific article; zbMATH DE number 2191999 (Why is no real title available?)
- scientific article; zbMATH DE number 2197922 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
- Graceful labelings of nearly complete graphs
- New families of graceful disconnected graphs.
- On sequential labelings of graphs
Cited in
(3)
This page was built for publication: The gracefulness of the join of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324910)