Gracefulness of families of spiders

DOI10.2140/INVOLVE.2010.3.241zbMATH Open1201.05080OpenAlexW2071975888MaRDI QIDQ611883FDOQ611883

Authors: Patrick Bahls, Sara Lake, Andrew Wertheim 

Publication date: 15 December 2010

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2010.3.241

Recommendations

• On graceful spider graphs with at most four 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)\)
• Graceful labeling of some classes of spider graphs with three legs greater than one
• GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
• scientific article; zbMATH DE number 6719738

zbMATH Keywords

treegraceful labelinggraph labeling

Mathematics Subject Classification ID

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

Cited In (11)

• Vertex graceful labeling of some classes of graphs
• Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
• Title not available (Why is that?)
• 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)\)
• Graceful wind chimes
• Graceful pairings
• Spiders can be recognized by counting their legs
• Title not available (Why is that?)
• On graceful spider graphs with at most four legs of lengths greater than one
• Computer search for graceful labeling: a survey

This page was built for publication: Gracefulness of families of spiders

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