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.
Comments: 8 Pages.
[v1] 2018-09-20 01:20:56
Unique-IP document downloads: 3 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.