Skip to main content
Log in

On 0-Rotatable Graceful Caterpillars

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

An injection \(f :V(T) \rightarrow \{0,\ldots ,|E(T)|\}\) of a tree T is a graceful labelling if \(\{|f(u)-f(v)| :uv \in E(T)\}=\{1,\ldots ,|E(T)|\}\). Tree T is 0-rotatable if, for any \(v \in V(T)\), there exists a graceful labelling f of T such that \(f(v)=0\). In this work, the following families of caterpillars are proved to be 0-rotatable: caterpillars with a perfect matching; caterpillars obtained by linking one leaf of the star \(K_{1,s-1}\) to a leaf of a path \(P_n\) with \(n \ge 3\) and \(s \ge \lceil \frac{n}{2} \rceil \); caterpillars with diameter five or six; and caterpillars T with \(\mathrm {diam}(T) \ge 7\) such that, for every non-leaf vertex \(v \in V(T)\), the number of leaves adjacent to v is even and is at least \(2+2((\mathrm {diam}(T)-1)\bmod {2})\). These results reinforce the conjecture that all caterpillars with diameter at least five are 0-rotatable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Anick, D.: Counting graceful labelings of trees: a theoretical and empirical study. Discret. Appl. Math. 198, 65–81 (2016)

    Article  MathSciNet  Google Scholar 

  2. Broersma, A.J., Hoede, C.: Another equivalent of the graceful tree conjecture. Ars Combinatoria 51, 183–192 (1999)

    MathSciNet  MATH  Google Scholar 

  3. Bussel, F.V.: 0-Centred and 0-ubiquitously graceful trees. Discret. Math. 277(1–3), 193–218 (2004)

    Article  MathSciNet  Google Scholar 

  4. Cattell, R.: Graceful labellings of paths. Discret. Math. 307(24), 3161–3176 (2007)

    Article  MathSciNet  Google Scholar 

  5. Chung, F.R.K., Hwang, F.K.: Rotatable graceful graphs. Ars Combinatoria 11, 239–250 (1981)

    MathSciNet  MATH  Google Scholar 

  6. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combinatorics DS6, 1–502 (2018)

    Google Scholar 

  7. Hrnčiar, P., Haviar, A.: All trees of diameter five are graceful. Discret. Math. 233(1–3), 133–150 (2001)

    Article  MathSciNet  Google Scholar 

  8. Huang, C., Kotzig, A., Rosa, A.: Further results on tree labellings. Util. Math. 21, 31–48 (1982)

    MathSciNet  MATH  Google Scholar 

  9. Mishra, D., Panigrahi, P.: Some graceful lobsters with both odd and even degree vertices on the central path. Util. Math. 74, 155–177 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Rosa, A.: On certain valuations of the vertices of a graph. Theory of Graphs (International Symposium, Rome, Italy, 1966), pp. 349–355. Gordon and Breach, New York (1967)

    Google Scholar 

  11. Rosa, A.: Labeling snakes. Ars Combinatoria 3, 67–73 (1977)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was funded by São Paulo Research Foundation (FAPESP) grants 2014/16987-1, 2014/16861-8, 2015/03372-1; and NSERC grant 41705-2014 057082.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atílio G. Luiz.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Luiz, A.G., Campos, C.N. & Richter, R.B. On 0-Rotatable Graceful Caterpillars. Graphs and Combinatorics 36, 1655–1673 (2020). https://doi.org/10.1007/s00373-020-02226-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02226-0

Keywords

Mathematics Subject Classification

Navigation