Laplacian Controllability of a Class of Non-Simple Ring Graphs
Sign Up to like & getrecommendations! Published in 2020 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2020.12.1666
Abstract: Abstract The Laplacian controllability of a family of graphs that are non-simple is studied in the paper. Without the regular assumption that the adjacency matrix is binary, the authors consider more flexible weighting parameters to… read more here.
Keywords: ring graphs; non simple; class; laplacian controllability ... See more keywords