scientific article; zbMATH DE number 3943871

From MaRDI portal
Publication:3715154





[For the entire collection see Zbl 0584.00012.] When the Möbius function \(\mu\) of a poset P has values \(+1,0,-1\) only, a signed graph S(P) is defind by taking P as its vertex set and the sign of edge \(e=xy\) as \(\mu\) (x,y). A signed graph S is called balanced if V(S) can be partitioned into subsets so that every positive edge and no negative edge joins two vertices in the same subset, and the number of such subsets is either one or two. When the number of subsets is not specified, S is called clusterable. We characterize balanced signed posets and discuss clusterable ones.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715154)