Abstract
The width distance between any two distinct vertices, which is the minimum of the length container between them in a connected graph, is applied to star link satellite constellation. The results can give recommendations to the designer of routing process in the system. This work gives an algorithm that connects the graph theory and the design of satellite networks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
