Y. Vaxès

activity

20092026

most citedConvergecast and Broadcast by Power-Aware Mobile Agents

17 citations · 52 across the 16 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Additive Quasi-isometry via rooted graph partitions and layering partition

Dibyayan Chakraborty, Yann Vaxès

For a graph $H$ , $⟨ H ⟩$ denotes the class of all subdivisions of $H$ and $tw (H)$ denotes the treewidth of $H$ . In this paper, we prove the following. For $k\geq 1, R\g…

math.CO2023★ 1 cited

Isometric path complexity of graphs

Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud +1

A set $S$ of isometric paths of a graph $G$ is `` $v$ -rooted'', where $v$ is a vertex of $G$ , if $v$ is one of the endpoints of all the isometric paths in $S$ . The isometric path co…

math.CO2022★ 1 cited

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G $^{2}$ -connected medians

Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1

The median function is a location/consensus function that maps any profile $π$ (a finite multiset of vertices) to the set of vertices that minimize the distance sum to vertices fro…

math.CO2022★ 1 cited

Graphs with $G^{p}$ -connected medians

Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$ . For any integer $p \geq 2$ ,…

Additive Quasi-isometry via rooted graph partitions and layering partition

Isometric path complexity of graphs

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians

Graphs with Gp-connected medians

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G $^{2}$ -connected medians

Graphs with $G^{p}$ -connected medians