Simple paths of maximum length in star graphs

The star graph has been known as an attractive model for interconnection networks due to its topological properties, capacity to simulate other basic network topologies and possibility to design efficient communication algorithms. In this paper we study the possibility to embed an array between any two nodes of a star graph and then we show that between any two nodes of a n-star graph there is a simple path that contains at least n! — 2 nodes.