A signed graph is a pair Γ=( G ,σ), where G =( V ( G ), E ( G )) is a graph and σ: E ( G ) → {+1, -1} is the sign function on the edges of G . For a signed graph we consider the least eigenvalue λ(Γ)… Expand

We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao’s conjecture. We give a characterization of graphs whose bicircular matroids are… Expand

Data in the social sciences can often modeled using signed graphs, graphs where every edge has a sign + or , or marked graphs, graphs where every vertex has a sign + or . The path graph Pk(G) of a… Expand

Con conformally indecomposable tensions of T(\Sigma,{\Bbb Z}) are classified as characteristic vectors of signed-graphic directed bonds and a class of characteristic vector of directed semi-bonds and d...Expand