The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_G(v)e_G(v)$, where $d_G(v)$ is ...

The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph `(...

A graceful difference labeling (gdl for short) of a directed graph $G$ with vertex set $V$ is a bijection `(f:V\rightarrow{1,\ldots,\vert V\vert}...

Given a directed graph $G=(V,A)$, capacity and cost functions on $A$, a root $r$, a subset $T \subset V$ of terminals, and an integer $k$...

Most papers on digital advertising focus on the point of view of Internet companies such as Google and Microsoft, and were written by people working for thos...

We consider the problems of determining the metric dimension and the minimum cardinality of doubly resolving sets in $n$-cubes. Most heuristics develope...

Nous donnons des conditions nécessaires et suffisante pour l'existence d'un graphe simple, ou d'un graphe connexe simple, ayant des nombres donnés `(m_{ij}...

This article discusses the problem of unloading a sequence of boxes from a single conveyor line with a minimum number of moves. The problem under study is ef...

Étant donné un graphe $G$ complet, orienté, avec des poids sur les sommets et les arcs, une $k$-coloration $\theta$-impropre de $G$ est une...

Le problème de la détermination du plus grand sous-graphe $k$-colorable ($k$-MCSP) consiste à colorer autant de sommets que possible avec au plus `...

Dans cet article nous étudions le problème de concevoir un réseau de collecte pour un parc éolien, dans le cas où la localisation des turbines et des câble...

Given a graph $G=(V,E)$ with a root $r\in V$, positive capacities $\{c(e) | e\in E\}$, and non-negative lengths $\{\ell(e) | e\in E\}$, the m...

This paper addresses the problem of minimizing the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data is known ...

An edge-coloring of a graph $G=(V,E)$ is a function $c$ that assigns an integer $c(e)$ (called color) in $\{0,1,2,\dotsc\}$ to every edge `(...

In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in ...

Écrire un texte de qualité est un processus complexe. Plusieurs domaines d'études se penchent sur les possibilités d'analyse des pratiques d'écriture des bon...

Given a complete directed graph $G$ with weights on the vertices and on the arcs, a $\theta$-improper $k$-coloring is an assignment of at most `...

An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The **dominating induced matchin...

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

Deux colorations des sommets d'un graphe sont dites équivalentes si elles correspondent à la même partition de l'ensemble des sommets en classes de couleurs....