Dimension of a lobster
Laleh Yahyaei, S. A. Katre · AKCE International Journal of Graphs and Combinatorics · 2018
A -labeling of a graph is a labeling of vertices of the graph by -tuples of non-negative integers in such a way that two vertices of are adjacent if and only if their label -tuples differ in each coordinate. The dimension of a graph is the least such that has a -labeling. In this paper we obtain the dimension of a lobster or close bounds for it in various cases.