Dimension of a lobster
L. Yahyaei, S.A. Katre
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1016/j.akcej.2018.08.001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.