On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs (Q2228131): Difference between revisions

\textit{T. Zaslavsky} [Discrete Appl. Math. 4, 47--74 (1982; Zbl 0476.05080)] showed that two signed graphs are sign-equivalent if and only if they have the same set of odd cycles. A signed graph is a pair \((G,\Sigma)\), where \(G=(V,E)\) is a graph with \(V=\{1,\dots,n\}\) and \(\Sigma\subseteq E\). The edges in \(\Sigma\) are called odd and the other edges of \(E\) even. By \(S(G,\Sigma)\) here denote the set of all symmetric \(n\times n\) matrices \(A=[a_{i,j}]\) with \(a_{i,j}<0\) if \(i\) and \(j\) are adjacent and connected by only even edges, \(a_{i,j}>0\) if \(i\) and \(j\) are adjacent and connected by only odd edges, \(a_{i,j}\in R\) if \(i\) and \(j\) are connected by both even and odd edges, \(a_{i,j}=0\) if \(i\neq j\) and \(i\) and \(j\) are non-adjacent, and \(a_{i,i }\in R\) for all vertices \(i\). The parameters \(M(G,\Sigma)\) and \(\xi(G,\Sigma)\) of a signed graph \((G,\Sigma)\) are the largest nullity of any matrix \(A\in S(G,\Sigma)\) and the largest nullity of any matrix \(\in S(G,\Sigma)\) that has the strong Arnold property, respectively. Here, the authors establish the characterization of signed graphs \((G,\Sigma)\) with \(M(G,\Sigma)\leq 1\) and of signed graphs with \(\xi(G,\Sigma)\leq 1.\) Some of the highlighed results are as follows: Characterize the 2-connected signed graphs \((G,\Sigma)\) with \(M(G,\Sigma)\leq 2\) and the 2-connected signed graphs \((G,\Sigma)\) with \(\xi(G,\Sigma)\leq 2\). This paper contains many useful results related to signed graphs, especially the strong Arnold property. This article motivates the researchers working in the area of signed graphs and its allied areas.