Computing connected components of graphs

Soghra Lazemi; Hossein Ebrahimpour-Komleh

doi:10.14419/ijamr.v3i4.3189

Abstract

In this article, we represent an algorithm for finding connected elements in an undirected graph with n vertices based on adjacency matrix.

Keywords: Connected Components, Adjacency Matrix, and Undirected Graph.

Authors and Affiliations

Soghra Lazemi University of Kashan
Hossein Ebrahimpour-Komleh University of Kashan

About this article

DOI: https://doi.org/10.14419/ijamr.v3i4.3189
Received: 16-07-2014
Accepted: 20-08-2014
Published: 25-10-2014
Views: 562
Downloads: 259

Download PDF

References

[1] J. Bondy, U. Murty, Graph Theory with Applications, MacMillan, New York, (1976).

[2] R. Diestel, Graph Theory, 4th Electronic Edition, (2010).

[3] R. Miller, L. Boxer, Algorithms Sequential and Parallel—a Unified Approach, Second Edition, Charles River Media, (2005).

[4] D. Jungnickel, Graphs, networks and algorithms, Berlin, Second Auflage, (2005).

[5] S. Steven, the Algorithm Design Manual, (2011).

How to Cite

Lazemi, S., & Ebrahimpour-Komleh, H. (2014). Computing connected components of graphs. International Journal of Applied Mathematical Research, 3(4), 508-510. https://doi.org/10.14419/ijamr.v3i4.3189

Download Citation