scientific article; zbMATH DE number 6719738
From MaRDI portal
Publication:2987399
Recommendations
- A new method for proving strongly (k, d)-graceful trees
- On bipartite strongly gracefulness and bipartite strongly odd-gracefulness of \((2m + 1,1)\)-\(p\)-trees
- Super total gracefulness of a class of spider trees
- Spanning trees of finite Sierpiński graphs
- On \((1,2)\)-strongly indexable spiders
- Spanning \(k\)-trees of \(n\)-connected graphs
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- On Graceful Labelings of Trees
- On graceful spider graphs with at most four legs of lengths greater than one
- \(k\)-strong gracefulness of graphs \(F_m^{(t)}\)
Cited in
(6)- Graceful labelings of the classes of spider graphs with four legs of lengths greater than one S_n(k,l,m,2)
- A class of trees having strongly graceful labellings
- Super total gracefulness of a class of spider trees
- On bipartite strongly gracefulness and bipartite strongly odd-gracefulness of \((2m + 1,1)\)-\(p\)-trees
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987399)
