On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced. A nut graph has a one dimensional kernel of the 0-1 adjacency matrix with a corresponding eigenvector tha...
Κύριοι συγγραφείς: | , , , |
---|---|
Μορφή: | Άρθρο |
Γλώσσα: | English |
Έκδοση: |
University of Zielona Góra
2022-11-01
|
Σειρά: | Discussiones Mathematicae Graph Theory |
Θέματα: | |
Διαθέσιμο Online: | https://doi.org/10.7151/dmgt.2436 |