Add to ORKG[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between u and v. Let j, k be positive integers with j >= k. An L(j, k)-labelling for G is a function f : V(G) -> {0, 1, 2, ...} such that for any two vertices u and v, vertical bar f(u) - f(v)vertical bar is at least j if d(u, v) = 1; and is at least k if d(u, v) = 2. The span of f is the difference between the largest and the smallest numbers in f (V). The lambda(j,k)-number for G, denoted by lambda(j,k)(G), is the minimum span over all L(j, k)-labellings of G. We introduce a new parameter for a tree T, namely, the maximum ordering-degree, denoted by M(T). Combining this new parameter and the special family of infinite trees introduced by Chang and ...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
Given a finite or infinite graph G and positive integers `, h1, h2, h3, an L(h1, h2, h3)-labelling o...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertice...
An L(h,k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
AbstractAn L(h,k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent ...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
If $T=(V,E)$ is a tree on vertex set $V$, where $|V|=n$, a labelling of $T $ is a bijection $\phi$ f...
AbstractFor positive integers j⩾k, an L(j,k)-labeling of graph G is an integer labeling of V(G) such...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
Given a finite or infinite graph G and positive integers `, h1, h2, h3, an L(h1, h2, h3)-labelling o...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
[[abstract]]Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between ...
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertice...
An L(h,k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
AbstractAn L(h,k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent ...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
If $T=(V,E)$ is a tree on vertex set $V$, where $|V|=n$, a labelling of $T $ is a bijection $\phi$ f...
AbstractFor positive integers j⩾k, an L(j,k)-labeling of graph G is an integer labeling of V(G) such...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
ABSTRACT. L(2;1)-labeling was rst dened by Jerrold Griggs [Gr, 1992] as a way to use graphs to model...
Given a finite or infinite graph G and positive integers `, h1, h2, h3, an L(h1, h2, h3)-labelling o...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...