Please use this identifier to cite or link to this item:
/library/oar/handle/123456789/102287| Title: | Controllability of NEPSes of graphs |
| Authors: | Farrugia, Alexander Koledin, Tamara 厂迟补苍颈膰,&#虫20;窜辞谤补苍 |
| Keywords: | Eigenvalues -- Graphic methods Eigenvectors -- Graphic methods Laplacian matrices Graph theory -- Study and teaching (Higher) |
| Issue Date: | 2022 |
| Publisher: | Taylor & Francis |
| Citation: | 贵补谤谤耻驳颈补,&#虫20;础.,&#虫20;碍辞濒别诲颈苍,&#虫20;罢.,&#虫20;&补尘辫;&#虫20;厂迟补苍颈膰,&#虫20;窜.&#虫20;(2022).&#虫20;颁辞苍迟谤辞濒濒补产颈濒颈迟测&#虫20;辞蹿&#虫20;狈贰笔厂别蝉&#虫20;辞蹿&#虫20;驳谤补辫丑蝉.&#虫20;尝颈苍别补谤&#虫20;补苍诲&#虫20;惭耻濒迟颈濒颈苍别补谤&#虫20;础濒驳别产谤补,&#虫20;70(10),&#虫20;1928-1941. |
| 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 vector (Formula presented.), then we simply say that G is controllable. In this paper, we consider the controllability of non-complete extended p-sums (for short, NEPSes) of graphs. We establish some general results and then focus the attention to the controllability of paths and related NEPSes. Moreover, the controllability of Cartesian products and tensor products is also considered. Certain related results concerning signless Laplacian matrices and signed graphs are reported. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/102287 |
| Appears in Collections: | Scholarly Works - JCMath |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Controllability of NEPSes of graphs 2022.pdf Restricted Access | 1.25 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.