Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity
Preprint
Abstract
How to draw the vertices of a complete multipartite graph $G$ on different points of a bounded $d$-dimensional integer grid, such that the sum of squared distances between vertices of $G$ is (i) minimized or (ii) maximized? For both problems we provide a characterization of the solutions. For the particular case $d=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.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Spectral Bisection with Two EigenvectorsElectronic Notes in Discrete Mathematics, 2017
- Spectral Clustering and Biclustering2013
- Old and new results on algebraic connectivity of graphsLinear Algebra and its Applications, 2007
- Spectral partitioning works: Planar graphs and finite element meshesLinear Algebra and its Applications, 2007
- Drawing graphs by eigenvectors: theory and practiceComputers & Mathematics with Applications, 2005
- Sums of Squares of Distances in m-SpaceThe American Mathematical Monthly, 2003
- Laplace eigenvalues and bandwidth-type invariants of graphsJournal of Graph Theory, 1993
- Optimal linear labelings and eigenvalues of graphsDiscrete Applied Mathematics, 1992
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Optimal labelling of a product of two pathsDiscrete Mathematics, 1975