Publication

Abstract : The research focuses on the efficient approach to find out the connectivity between nodes and provides the list of networks of the network if available. Networks can be logically represented as a graph; graph traversal is one of the common mechanisms in the network to find the connectivity and subnetworks. In this proposed approach stacks are used to find a number of connected components. The number of resultant stacks is a metric for measurement of components. The proposed algorithm is efficient compared to graph traversal techniques like BFS and DFS as its order of complexity is O(n2). Finding a number of components can be useful to find connectivity in networks to check reachability in the network, connectivity in any electronic circuits and island and so on. The graph can be represented by adjacency matrix or incidence matrix. If there is an edge between two vertices then it is represented by 1 and 0 otherwise. Incidence matrix is an n*m matrix where n is a number of vertices and m is a number of edges, where rows represent vertices and column represents edges. If two vertices are connected by an edge then it is represented by 1 and 0 otherwise.