Dimension of a lobster
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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.08.001 |