Hamid Mokhtar

collaborators

2 papers

math.CO2020

Distance-constrained labellings of Cartesian products of graphs

Anna Lladó, Hamid Mokhtar, Oriol Serra +1

An $L (h_{1}, h_{2}, \dots, h_{l})$ -labelling of a graph $G$ is a mapping $ϕ : V (G) \to {0, 1, 2, \dots}$ such that for $1 \leq i \leq l$ and each pair of vertices $u, v$ of $G$ at…

math.CO2018

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar +2

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is…