pith. sign in

arxiv: 1412.6984 · v1 · pith:S2CNU7SRnew · submitted 2014-12-22 · 🧮 math.CO

A counterexample to a conjecture of Ghosh

classification 🧮 math.CO
keywords centraldiameterghoshlabelmaximumtreevertexaccept
0
0 comments X
read the original abstract

We answer two questions of Shamik Ghosh in the negative. We show that there exists a lobster tree of diameter less than 6 which accepts no alpha-labeling with two central vertices labeled by the critical number and the maximum vertex label. We also show a simple example of a tree of diameter 4, with an even degree central vertex which does not accept a maximum label in any graceful labeling.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.