GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE LEGS OF LENGTHS GREATER THAN ONE
From MaRDI portal
Recommendations
- 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 spider graphs with at most four legs of lengths greater than one
- The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths
- Notes on three edge-graceful labelings of graphs
- scientific article; zbMATH DE number 4148141
- Nearly graceful labelings of graphs
- Vertex labeling of spider graph
- Graphs with edge-odd graceful labelings
- On \(k\)-graceful labeling of some graphs
Cited in
(7)- 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 some classes of spider graphs with three legs greater than one
- scientific article; zbMATH DE number 4148141 (Why is no real title available?)
- Vertex labeling of spider graph
- Gracefulness of families of spiders
- On graceful spider graphs with at most four legs of lengths greater than one
This page was built for publication: GRACEFUL LABELING OF SPIDER GRAPHS WITH THREE 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 Q2963104)