Print Email Facebook Twitter Fiedler’s Clustering on m?dimensional Lattice Graphs Title Fiedler’s Clustering on m?dimensional Lattice Graphs Author Trajanovski, S. Van Mieghem, P. Faculty Electrical Engineering, Mathematics and Computer Science Department Network Architectures & Services (NAS) Date 2010-06-11 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. To reference this document use: http://resolver.tudelft.nl/uuid:6bd04fb9-453f-4bce-926b-f1bd79903776 Source 3rd International Workshop on Optimal Network Topologies (IWONT), 9-11 June 2010, Barcelona, Spain Part of collection Institutional Repository Document type conference paper Rights (c) 2010 Trajanovski, S.Van Mieghem, P. Files PDF IWONT_FiedlerLattice_STra ... vski-1.pdf 245.36 KB Close viewer /islandora/object/uuid:6bd04fb9-453f-4bce-926b-f1bd79903776/datastream/OBJ/view