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

DOI10.1155/2016/5327026MaRDI QIDQ670265zbMATH OpenOpenAlexWikidataFDO

Authors A. Panpa, T. Poomsa-ard

Publication date 18 March 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/5327026

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Graceful labelings of the classes of spider graphs with four legs of lengths greater than one \(S_n(k,l,m,2)\)
• 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
• scientific article; zbMATH DE number 4148141
• The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths
• Decomposition of bipartite graphs into spiders all of whose legs are two in length.
• scientific article; zbMATH DE number 6719738
• Some results on graceful graphs
• ON SOME NEW GRACEFUL GRAPHS
• scientific article; zbMATH DE number 3997848

Cites work

• scientific article; zbMATH DE number 7225155 (Why is no real title available?)
• scientific article; zbMATH DE number 3815667 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• All trees of diameter five are graceful
• 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
• Graceful labelings of the classes of spider graphs with four legs of lengths greater than one \(S_n(k,l,m,2)\)
• Gracefulness of families of spiders

Cited in

(10)

• scientific article; zbMATH DE number 6719738 (Why is no real title available?)
• Graceful labeling of some classes of spider graphs with three legs greater than one
• On graceful generalized spiders and caterpillars.
• Graceful labelings of the classes of spider graphs with four legs of lengths greater than one \(S_n(k,l,m,2)\)
• Gracefulness of families of spiders
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
• On minimum intersections of certain secondary dominating sets in graphs
• scientific article; zbMATH DE number 4148141 (Why is no real title available?)
• Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
• Super total gracefulness of a class of spider trees

This page was built for publication: On graceful spider graphs with at most four legs of lengths greater than one

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