Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Generating graceful trees from caterpillars by recursive attachment

From MaRDI portal
Publication:327636
Jump to:navigation, search

DOI10.1016/j.endm.2016.05.012zbMath1347.05220OpenAlexW2509677544MaRDI QIDQ327636

G. Sethuraman, Veerapazham Murugan

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.012

zbMATH Keywords

graceful treegraph labelinggraceful tree conjecture


Mathematics Subject Classification ID

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


Related Items

Unnamed Item



Cites Work

  • Two theorems on graceful trees
  • All arbitrarily fixed generalized banana trees are graceful
  • The subdivision graph of a graceful tree is a graceful tree
  • A dynamic survey of graph labeling
  • All trees of diameter five are graceful
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:327636&oldid=12204175"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki