| Autor: |
Anđelić, M., Koledin, T., Stanić, Z., Wang, J. |
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics; May 2023, Vol. 20 Issue: 2 p177-184, 8p |
| Abstrakt: |
AbstractGiven a signed graph , let and be its standard adjacency matrix and the diagonal matrix of net-degrees, respectively. The net Laplacian matrix of is defined as . In this paper we investigate signed graphs whose net Laplacian spectrum consists entirely of integers. The focus is mainly on the two extreme cases, the one in which all eigenvalues of are simple and the other in which has 2 or 3 (distinct) eigenvalues. Both cases include structure theorems, degree constraints and particular constructions of new examples. Several applications in the framework of control theory are reported. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
