10 research outputs found

    Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity

    Full text link
    How to draw the vertices of a complete multipartite graph GG on different points of a bounded dd-dimensional integer grid, such that the sum of squared distances between vertices of GG is (i) minimized or (ii) maximized? For both problems we provide a characterization of the solutions. For the particular case d=1d=1, our solution for (i) also settles the minimum-2-sum problem for complete bipartite graphs; the minimum-2-sum problem was defined by Juvan and Mohar in 1992. Weighted centroidal Voronoi tessellations are the solution for (ii). Such drawings are related with Laplacian eigenvalues of graphs. This motivates us to study which properties of the algebraic connectivity of graphs carry over to the restricted setting of drawings of graphs with integer coordinates.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018
    corecore