## Abstract

The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, characterizes the performance of some dynamic processes on networks, such as consensus in multiagent networks, synchronization of coupled oscillators, random walks on graphs, and so on. In a multiagent network, for example, the larger the algebraic connectivity of the graph representing interactions between agents is, the faster the convergence speed of a representative consensus algorithm is. This paper tackles the problem of finding graphs that maximize or locally maximize the algebraic connectivity in the space of graphs with a fixed number of vertices and edges. It is shown that some well-known classes of graphs such as star graphs, cycle graphs, complete bipartite graphs, and circulant graphs are algebraic connectivity maximizers or local maximizers under certain conditions.

Original language | English |
---|---|

Pages (from-to) | 359-368 |

Number of pages | 10 |

Journal | IEEE Transactions on Control of Network Systems |

Volume | 4 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2017 |

## Keywords

- Algebraic connectivity
- Laplacian matrix
- consensus algorithm
- convergence rate
- multiagent network

## ASJC Scopus subject areas

- Control and Systems Engineering
- Signal Processing
- Computer Networks and Communications
- Control and Optimization