Motion Planning in Certain Lexicographic Product Graphs
Abolape Deborah Akwu, Opeyemi Oyewumi · viXra · 2018
In this article, we give the minimum number of moves required for the motion planning problem in Lexicographic products of some graphs. In addition, we proved the necessary and sufficient condition for the connectivity of the lexicographic product of two graphs.