Abstract:
Computation of Laplacian spectra is considered for complete and complete uniform undirected and directed hypergraphs which Laplacians are circulants. Standard methods are used for computation of circulant spectra. Applications are discussed to consensus problems in multi-agent systems taking account of agents' group interactions.
Keywords:complete and complete uniform undirected and directed hypergraphs, Laplacians, circulants, spectra, multi-agent systems, consensus problems, agents' group interactions.
Fulltext:
PDF file (563 kB)