AbstractLet T be a tree with maximum degree Δ≥4. Let DΔ(T) denote the set of integers k for which there exist two distinct vertices of maximum degree of distance at k in T. It was known that Δ+1≤λt2(T)≤Δ+2. In this paper, we prove that if 3,4∉DΔ(T), then λt2(T)=Δ+1
AbstractFor a graph G let w−1(G) be the sum of (dG(u)dG(v))−1 over all edges uv of G. Clark and Moon...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
AbstractAn L(2,1,1)-labeling of a graph G assigns nonnegative integers to the vertices of G in such ...
AbstractIt was known that every tree T with maximum degree Δ has Δ+1≤λ2T(T)≤Δ+2. In [14], Wang and C...
AbstractLet T be a tree with maximum degree Δ≥4. Let DΔ(T) denote the set of integers k for which th...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
AbstractIt was known that every tree T with maximum degree Δ has Δ+1≤λ2T(T)≤Δ+2. In [14], Wang and C...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
If $T=(V,E)$ is a tree on vertex set $V$, where $|V|=n$, a labelling of $T $ is a bijection $\phi$ f...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
AbstractThe (2,1)-total labelling number λ2T(G) of a graph G is the width of the smallest range of i...
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(2,1)-labeling of a graph G is defined as a function f from the vertex set V(G) into the...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
AbstractFor a graph G let w−1(G) be the sum of (dG(u)dG(v))−1 over all edges uv of G. Clark and Moon...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
AbstractAn L(2,1,1)-labeling of a graph G assigns nonnegative integers to the vertices of G in such ...
AbstractIt was known that every tree T with maximum degree Δ has Δ+1≤λ2T(T)≤Δ+2. In [14], Wang and C...
AbstractLet T be a tree with maximum degree Δ≥4. Let DΔ(T) denote the set of integers k for which th...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
AbstractIt was known that every tree T with maximum degree Δ has Δ+1≤λ2T(T)≤Δ+2. In [14], Wang and C...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
If $T=(V,E)$ is a tree on vertex set $V$, where $|V|=n$, a labelling of $T $ is a bijection $\phi$ f...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
AbstractThe (2,1)-total labelling number λ2T(G) of a graph G is the width of the smallest range of i...
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(2,1)-labeling of a graph G is defined as a function f from the vertex set V(G) into the...
AbstractLet h≥1 be an integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignmen...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
AbstractFor a graph G let w−1(G) be the sum of (dG(u)dG(v))−1 over all edges uv of G. Clark and Moon...
AbstractThe L(p,q)-labelling of graphs, is a graph theoretic framework introduced by Griggs and Yeh ...
AbstractAn L(2,1,1)-labeling of a graph G assigns nonnegative integers to the vertices of G in such ...
DOI
Add to ORKG