相关论文: Distance-two labelings of digraphs

Let $D=(V,A)$ be a digraph of order $n$, $S$ a subset of $V$ of size $k$ and $2\le k\leq n$. Strong subgraphs $D_1, \dots , D_p$ containing $S$ are said to be internally disjoint if $V(D_i)\cap V(D_j)=S$ and $A(D_i)\cap A(D_j)=\emptyset$…

Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is…

The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists in reversing the direction of all arcs of $D\langle X\rangle$. The {\it inversion number} of an oriented graph $D$, denoted by ${\rm inv}(D)$, is the minimum number of…

For a set of distances $D$, a graph $G$ of order $n$ is said to be $D-$magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots, n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) =k$, where…

The digirth of a digraph is the length of a shortest directed cycle. The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the smallest size of a partition of the vertex-set into subsets inducing acyclic subgraphs. A conjecture by…

A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We…

A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. We propose a series of new labeling…

The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…

A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…

Let $G=(V,E,w)$ be a weighted directed graph without negative cycles. For two vertices $s,t\in V$, we let $d_{\le h}(s,t)$ be the minimum, according to the weight function $w$, of a path from $s$ to $t$ that uses at most $h$ edges, or hops.…

In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-balanced graph if we have mAg2h=mAh2g. In this article, we…

Multi-label classification is a type of supervised learning where an instance may belong to multiple labels simultaneously. Predicting each label independently has been criticized for not exploiting any correlation between labels. In this…

A subset $D\subseteq V(G)$ is called a $k$-distance dominating set of $G$ if every vertex in $V(G)\setminus D$ is within distance $k$ from some vertex of $D$. The minimum cardinality among all $k$-distance dominating sets of $G$ is called…

Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an input digraph G=(V,A) by a number k of sequences with entries…

Computing the shortest-path distance between any two given vertices in road networks is an important problem. A tremendous amount of research has been conducted to address this problem, most of which are limited to static road networks.…

In this article, we study the $d$-distance $m$-tuple ($\ell, r$)-domination problem. Given a simple undirected graph $G=(V, E)$, and positive integers $d, m, \ell$ and $r$, a subset $V' \subseteq V$ is said to be a $d$-distance $m$-tuple…

Let \( D \) be a strongly connected digraph. The average distance of a vertex \( v \) in \( D \) is defined as the arithmetic mean of the distances from \( v \) to all other vertices in \( D \). The remoteness \( \rho(D) \) of \( D \) is…

We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. The six-length of a vertex $v\in V$ is defined from the…

We consider the bipartite version of the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 2, find the maximum number Nb({\Delta},D) of vertices in a bipartite graph of maximum degree {\Delta} and diameter D.…

A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…