Abstract

Our purpose in the present paper is to investigate different topological properties of the recently introduced star graphs which are being viewed as attractive alternatives to n-cubes or hypercubes. These properties are interesting by themselves from a graph theory point of view as well as they have direct in generating vertex disjoint paths and minimal paths in a star graph. They can also be readily utilized to design routing algorithms and to compute contention and traffic congestion in networks that use star graphs as the underlying topology.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call