Unique Links in Graphs

摘要

This approach of unique links in graphs is due to two major reasons: the exaggerated complexity of an existent algorithm for determining them and inexistence of a concrete algorithm to offer exactly the irredundant edges developed from a specific node of the graph. The proposed method allows to obtain all the edges initiated from a specific node together with a practical identification of unique links in graph.