Related papers: Distance-two labelings of digraphs

Let $\mathcal{G} = (\mathcal{V}, \mathcal{E})$ be a simple graph, an $L(2,1)$-labeling of $\mathcal{G}$ is an assignment of labels from nonnegative integers to vertices of $\mathcal{G}$ such that adjacent vertices get labels which differ by…

$k$-Approximate distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the $k$-approximation of the distance between any two vertices $u$ and $v$ can be determined efficiently by merely…

A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number $\chi$ 2 (G) of G is then the mallest…

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…

In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph $G$ such that from the labels of any three vertices $u,v,f$ we can infer the $u$-to-$v$ distance in the graph $G\setminus \{f\}$. We show that any…

A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$-connected if it has at least $k+1$ vertices and remains strongly connected when we delete…

A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a…

Given a fixed $k$ $\in$ $\mathbb{Z}^+$ and $\lambda$ $\in$ $\mathbb{Z}^+$, the objective of a $\lambda$-$L(k, k-1, \ldots, 2, 1)$-labeling of a graph $G$ is to assign non-negative integers (known as labels) from the set $\{0, \ldots,…

For an arbitrary finite family of graphs, the distance labeling problem asks to assign labels to all nodes of every graph in the family in a way that allows one to recover the distance between any two nodes of any graph from their labels.…

A longest path in a graph is called a detour. Denote by $a(k,n)$ the minimum number of detours in a connected graph with minimum degree $k$ and order $n,$ and denote by $b(k,n)$ the minimum odd number of detours in such a graph. X. Zhan has…

The exact path length problem is to determine if there is a path of a given fixed cost between two vertices. This paper focuses on the exact path problem for costs $-1,0$ or $+1$ between all pairs of vertices in an edge-weighted digraph.…

A Langford sequence of order $m$ and defect $d$ can be identified with a labeling of the vertices of a path of order $2m$ in which each labeled from $d$ up to $d+m-1$ appears twice and in which the vertices that have been label with $k$ are…

Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_1\le p_2...\le p_k$. Let $P_j=\sum_{i=1}^jp_i$ for $j=1,...,k$. It is conjectured that $G$ has distance magic labeling if and only if $\sum_{i=1}^{P_j}…

Given integers $k,j$ with $1\le j \le k-1$, we consider the length of the longest $j$-tight path in the binomial random $k$-uniform hypergraph $H^k(n,p)$. We show that this length undergoes a phase transition from logarithmic length to…

Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E.$ The classical distance $d_{ij}^D$ from $i$ to $j$ in $D$ is the length of a shortest directed path from $i$ to $j$ in $D.$ Let $L$ be the…

For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$,…

Consider an undirected weighted graph G=(V,E) with |V|=n and |E|=m, where each vertex v is assigned a label from a set L of \ell labels. We show how to construct a compact distance oracle that can answer queries of the form: "what is the…

A graph $G$ is said to be distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N(x)} f(y) ={\sf k}$, where $N_(x)$ is the set of all neighbours of…

An $L(h_1, h_2, \ldots, h_l)$-labelling of a graph $G$ is a mapping $\phi: V(G) \rightarrow \{0, 1, 2, \ldots\}$ such that for $1\le i\le l$ and each pair of vertices $u, v$ of $G$ at distance $i$, we have $|\phi(u) - \phi(v)| \geq h_i$.…

The metric dimension, $\dim(G)$, of a graph $G$ is a graph parameter motivated by robot navigation that has been studied extensively. Let $G$ be a graph with vertex set $V(G)$, and let $d(x,y)$ denote the length of a shortest $x-y$ path in…