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

DOI10.1155/2016/5327026zbMATH Open1435.05174OpenAlexW2554597228WikidataQ59125212 ScholiaQ59125212MaRDI QIDQ670265FDOQ670265

Authors: A. Panpa, T. Poomsa-ard 

Publication date: 18 March 2019

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

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• All trees of diameter five are graceful
• Title not available (Why is that?)
• Gracefulness of families of spiders
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS 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)\)
• Title not available (Why is that?)
• Graceful labeling of some classes of spider graphs with three legs greater than one

Cited In (10)

• On minimum intersections of certain secondary dominating sets in graphs
• Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
• 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)\)
• On graceful generalized spiders and caterpillars.
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
• Title not available (Why is that?)
• Gracefulness of families of spiders
• Super total gracefulness of a class of spider trees
• Title not available (Why is that?)

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)