The gracefulness of the join of graphs. II

DOI10.1016/J.AKCEJ.2015.11.013zbMATH Open1346.05254OpenAlexW2595723301MaRDI QIDQ322012FDOQ322012

L. Y. Phoon, K. W. Soh, K. M. Koh

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.013

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\)

zbMATH Keywords

Eulerian graphjoin of graphsbroken pathgraceful graph

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• A dynamic survey of graph labeling
• The gracefulness of the join of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• ON SOME NEW GRACEFUL GRAPHS
• Title not available (Why is that?)

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)