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...
Main Authors: | Bašić Nino, Fowler Patrick W., Pisanski Tomaž, Sciriha Irene |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2436 |
Similar Items
-
Additively graceful signed graphs
by: Jessica Pereira, et al.
Published: (2023-09-01) -
Signed Complete Graphs with Maximum Index
by: Akbari Saieed, et al.
Published: (2020-05-01) -
Existence of Regular Nut Graphs for Degree at Most 11
by: Fowler Patrick W., et al.
Published: (2020-05-01) -
Computing the determinant of a signed graph
by: Alshamary Bader, et al.
Published: (2024-03-01) -
Star complements for ±2 in signed graphs
by: Mulas Raffaella, et al.
Published: (2022-02-01)