13 citations · 22 across the 5 of their papers we have counts for
5 papers · 1 filter
Distance-constrained labellings of Cartesian products of graphs
Anna Lladó, Hamid Mokhtar, Oriol Serra +1
An -labelling of a graph is a mapping such that for and each pair of vertices of at…
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…
Recursive cubes of rings as models for interconnection networks
Hamid Mokhtar, Sanming Zhou
We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group…
An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs
Bohao Yao, Charl Ras, Hamid Mokhtar
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this informa…
Forwarding and optical indices of 4-regular circulant networks
Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou
An all-to-all routing in a graph is a set of oriented paths of , with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing …