No label defined (Q3715154)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3943871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3943871 |
Statements
1984
0 references
clusterability
0 references
Möbius function
0 references
poset
0 references
signed graph
0 references
balanced signed posets
0 references
0.754025399684906
0 references
0.7427452802658081
0 references
0.7411431074142456
0 references
[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.
0 references