Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/700
Title: | Controllability of NEPSes of graphs |
Authors: | Farrugia, Alexander Koledin, Tamara Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization |
Keywords: | 05C50;93B05;93C05;controllability;Graph eigenvalues and eigenvectors;graph product;path;signed graph |
Issue Date: | 2022 |
Rank: | M21 |
Journal: | Linear and Multilinear Algebra |
Abstract: | If G is a graph with n vertices, (Formula presented.) is its adjacency matrix and (Formula presented.) is a binary vector of length n, then the pair (Formula presented.) is said to be controllable (or G is said to be controllable for the vector (Formula presented.)) if (Formula presented.) has no eigenvector orthogonal to (Formula presented.). In particular, if (Formula presented.) is the all-1 ve... |
URI: | https://research.matf.bg.ac.rs/handle/123456789/700 |
ISSN: | 03081087 |
DOI: | 10.1080/03081087.2020.1778622 |
Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.