An upper bound on the nullity of signed graphs
Combinatorics
2022-08-16 v2
Abstract
In this paper, an upper bound on the nullity of signed graphs in terms of the cyclomatic number and the number of pendant vertices is proved, and the corresponding extremal signed graphs are completely characterized.
Keywords
Cite
@article{arxiv.2208.01950,
title = {An upper bound on the nullity of signed graphs},
author = {Keming Liu and Xiying Yuan},
journal= {arXiv preprint arXiv:2208.01950},
year = {2022}
}