On graceful spider graphs with at most four legs of lengths greater than one
From MaRDI portal
Publication:670265
DOI10.1155/2016/5327026zbMath1435.05174OpenAlexW2554597228WikidataQ59125212 ScholiaQ59125212MaRDI QIDQ670265
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
Related Items
Cites Work
- 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)
- All trees of diameter five are graceful
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item