51. Fiedler’s Clustering on m?dimensional Lattice Graphs
- Author
-
Trajanovski, S. (author), Van Mieghem, P. (author), Trajanovski, S. (author), and Van Mieghem, P. (author)
- Abstract
We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph PN and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler’s threshold., Network Architectures & Services (NAS), Electrical Engineering, Mathematics and Computer Science
- Published
- 2010