Graceful labelings of the classes of spider graphs with four legs of lengths greater than one S_n(k,l,m,2)

DOI10.17654/MS100020255zbMATH Open1355.05215MaRDI QIDQ2963121FDOQ2963121

Authors: K. Sangsura, T. 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

Recommendations

• On graceful spider graphs with at most four legs of lengths greater than one
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
• Graceful labeling of some classes of spider graphs with three legs greater than one
• Gracefulness of families of spiders
• scientific article; zbMATH DE number 6719738

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)

Cited In (6)

• Graceful labeling of some classes of spider graphs with three legs greater than one
• On graceful generalized spiders and caterpillars.
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
• Gracefulness of families of spiders
• Super total gracefulness of a class of spider trees
• 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)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963121)