Summary
International Symposium on Nonlinear Theory and Its Applications
2016
Session Number:C1L-E
Session:
Number:C1L-E-1
Extensions of a Theorem on Algebraic Connectivity Maximizing Graphs
Ryoya Ishii, Norikazu Takahashi,
pp.-
Publication Date:2016/11/27
Online ISSN:2188-5079
Summary:
The second smallest eigenvalue of the Laplacian matrix of a graph, also known as the algebraic connectivity, is an important measure that represents how strongly the graph is connected. The algebraic connectivity also characterizes the performance of some dynamic processes on networks such as consensus in multiagent networks and synchronization of coupled oscillators. In this paper, we study the problem of finding graphs that maximize the algebraic connectivity among all graphs with the same number of vertices and edges, and extends a known result about complete bipartite graphs to complete multipartite graphs.