An upper bound on the nullity of signed graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.