Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics

DOI10.1007/s40314-022-02141-5OpenAlexW4311220531MaRDI QIDQ2685260

Milica Anđelić, Zoran Stanić, Tamara Koledin, Abdullah Al-Azemi

Publication date: 20 February 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-02141-5

zbMATH Keywords

eigenvectorsLaplacian spectrumchain graphcontrollable dynamical system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Spectra of graphs
• On energy and Laplacian energy of chain graphs
• Graphs for which the least eigenvalue is minimal. II.
• Interconnection topologies for multi-agent coordination under leader-follower framework
• Threshold graphs and related topics
• Laplacian controllability for graphs obtained by some standard products
• Sharp spectral inequalities for connected bipartite graphs with maximal Q-index
• Controllability of multiagent systems based on path and cycle graphs
• Controllability of NEPSes of graphs
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Chain graph sequences and Laplacian spectra of chain graphs

This page was built for publication: Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics