An upper bound on the nullity of signed graphs

2022/08/03 by Liu Keming, Xiying Yuan, Liu, Keming +1
Mathematics · Computer Science · #Graph theory and applications #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2208.01950

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.

Related

• Further results on the nullity of signed graphs
• No signed graph with the nullity η(G,σ)=|V(G)|-2m(G)+2c(G)-1
• Frustration in signed graphs
• Two-connected signed graphs with maximum nullity at most two
• Characterizations of Some Parity Signed Graphs