GRACEFUL LABELINGS OF THE CLASSES OF SPIDER GRAPHS WITH FOUR LEGS OF LENGTHS GREATER THAN ONE S_n(k, l, m, 2)

DOI10.17654/MS100020255zbMath1355.05215MaRDI QIDQ2963121

K. Sangsura, Tiang Poomsa-ard

Publication date: 10 February 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9952.htm

zbMATH Keywords

graceful labelinginverse transformationspider graphs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

On graceful spider graphs with at most four legs of lengths greater than one

This page was built for publication: GRACEFUL LABELINGS OF THE CLASSES OF SPIDER GRAPHS WITH FOUR LEGS OF LENGTHS GREATER THAN ONE S_n(k, l, m, 2)