Net Laplacian controllability for joins of signed graphs

DOI10.1016/j.dam.2020.05.011zbMath1447.05099OpenAlexW3035516904MaRDI QIDQ2197420

Zoran Stanić

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.011

zbMATH Keywords

controllabilityjoinnet Laplacian matrixsigned threshold graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Some upper bounds for the net Laplacian index of a signed graph ⋮ Some properties of the eigenvalues of the net Laplacian matrix of a signed graph ⋮ Signed graphs with integral net Laplacian spectrum ⋮ The spectra of signed graphs obtained by \(\dot{H}\)-(generalized) join operation ⋮ The chromatic number of joins of signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian graph eigenvectors
• Threshold graphs and related topics
• Controllable subsets in graphs
• Laplacian controllability classes for threshold graphs
• Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
• Matrices in the Theory of Signed Simple Graphs
• Controllable graphs with least eigenvalue at least -2
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Viability theory

This page was built for publication: Net Laplacian controllability for joins of signed graphs